./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1250.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1250.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1250.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:54:23,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:54:23,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:54:23,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:54:23,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:54:23,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:54:23,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:54:23,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:54:23,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:54:23,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:54:23,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:54:23,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:54:23,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:54:23,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:54:23,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:54:23,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:54:23,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:54:23,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:54:23,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:54:23,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:54:23,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:54:23,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:54:23,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:54:23,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:54:23,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:54:23,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:54:23,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:54:23,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:54:23,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:54:23,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:54:23,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:54:23,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:54:23,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:54:23,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:54:23,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:54:23,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:54:23,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:54:23,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:54:23,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:54:23,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:54:23,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:54:23,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:54:23,851 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:54:23,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:54:23,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:54:23,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:54:23,854 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:54:23,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:54:23,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:54:23,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:54:23,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:54:23,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:54:23,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:54:23,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:54:23,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:54:23,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:54:23,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:54:23,858 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:54:23,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:54:23,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:54:23,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:54:23,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:54:23,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:54:23,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:23,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:54:23,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:54:23,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:54:23,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:54:23,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:54:23,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:54:23,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:54:23,863 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 [2020-07-28 17:54:24,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:54:24,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:54:24,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:54:24,202 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:54:24,202 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:54:24,203 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2020-07-28 17:54:24,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92da8346/003520846bf74e40a6719b8d6c548dd4/FLAGccd155635 [2020-07-28 17:54:24,719 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:54:24,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2020-07-28 17:54:24,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92da8346/003520846bf74e40a6719b8d6c548dd4/FLAGccd155635 [2020-07-28 17:54:25,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92da8346/003520846bf74e40a6719b8d6c548dd4 [2020-07-28 17:54:25,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:54:25,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:54:25,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:25,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:54:25,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:54:25,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191bdc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25, skipping insertion in model container [2020-07-28 17:54:25,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:54:25,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:54:25,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:25,356 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:54:25,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:25,408 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:54:25,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25 WrapperNode [2020-07-28 17:54:25,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:25,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:25,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:54:25,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:54:25,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:25,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:54:25,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:54:25,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:54:25,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... [2020-07-28 17:54:25,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:54:25,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:54:25,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:54:25,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:54:25,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:54:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:54:25,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:54:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:54:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:54:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:54:26,247 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:54:26,248 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:54:26,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:26 BoogieIcfgContainer [2020-07-28 17:54:26,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:54:26,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:54:26,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:54:26,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:54:26,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:54:25" (1/3) ... [2020-07-28 17:54:26,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2bbd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:26, skipping insertion in model container [2020-07-28 17:54:26,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:25" (2/3) ... [2020-07-28 17:54:26,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2bbd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:26, skipping insertion in model container [2020-07-28 17:54:26,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:26" (3/3) ... [2020-07-28 17:54:26,262 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2020-07-28 17:54:26,274 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:54:26,283 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:54:26,299 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:54:26,325 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:54:26,326 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:54:26,326 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:54:26,326 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:54:26,326 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:54:26,327 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:54:26,327 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:54:26,327 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:54:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-28 17:54:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:54:26,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:26,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:26,354 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-07-28 17:54:26,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:26,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829897728] [2020-07-28 17:54:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:26,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#true} is VALID [2020-07-28 17:54:26,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {31#true} is VALID [2020-07-28 17:54:26,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2020-07-28 17:54:26,522 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#false} assume 0 == __fpclassify_float_~w~0 % 4294967296 || 2147483648 == __fpclassify_float_~w~0 % 4294967296;__fpclassify_float_#res := 2; {32#false} is VALID [2020-07-28 17:54:26,522 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#false} fmax_float_#t~ret2 := __fpclassify_float_#res;assume -2147483648 <= fmax_float_#t~ret2 && fmax_float_#t~ret2 <= 2147483647; {32#false} is VALID [2020-07-28 17:54:26,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#false} assume 0 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {32#false} is VALID [2020-07-28 17:54:26,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x, isnan_float_~x) then 1 else 0); {32#false} is VALID [2020-07-28 17:54:26,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} main_#t~ret6 := isnan_float_#res;assume -2147483648 <= main_#t~ret6 && main_#t~ret6 <= 2147483647; {32#false} is VALID [2020-07-28 17:54:26,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0 == main_#t~ret6;havoc main_#t~ret6; {32#false} is VALID [2020-07-28 17:54:26,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 17:54:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:26,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829897728] [2020-07-28 17:54:26,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:26,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:54:26,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279577529] [2020-07-28 17:54:26,538 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:26,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:26,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:54:26,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:26,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:54:26,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:54:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:26,580 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-28 17:54:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,657 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-07-28 17:54:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:54:26,658 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:54:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:54:26,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2020-07-28 17:54:26,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:26,816 INFO L225 Difference]: With dead ends: 54 [2020-07-28 17:54:26,817 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 17:54:26,820 INFO L675 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 [2020-07-28 17:54:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 17:54:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-28 17:54:26,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:26,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:26,862 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:26,862 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,866 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-28 17:54:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-28 17:54:26,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,868 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:26,868 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,872 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-28 17:54:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-28 17:54:26,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:26,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 17:54:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-07-28 17:54:26,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-07-28 17:54:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:26,880 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-07-28 17:54:26,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:54:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-28 17:54:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:54:26,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:26,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:26,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:54:26,882 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:26,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-07-28 17:54:26,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:26,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662423244] [2020-07-28 17:54:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:26,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {184#true} is VALID [2020-07-28 17:54:26,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {184#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {184#true} is VALID [2020-07-28 17:54:26,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);call __fpclassify_float_#t~mem0 := read~int(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~real(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);havoc __fpclassify_float_#t~union1;havoc __fpclassify_float_#t~mem0;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {184#true} is VALID [2020-07-28 17:54:26,995 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#true} goto; {184#true} is VALID [2020-07-28 17:54:26,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {184#true} assume 0 == __fpclassify_float_~w~0 % 4294967296 || 2147483648 == __fpclassify_float_~w~0 % 4294967296;__fpclassify_float_#res := 2; {186#(<= 2 |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:26,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {186#(<= 2 |ULTIMATE.start___fpclassify_float_#res|)} fmax_float_#t~ret2 := __fpclassify_float_#res;assume -2147483648 <= fmax_float_#t~ret2 && fmax_float_#t~ret2 <= 2147483647; {187#(<= 2 |ULTIMATE.start_fmax_float_#t~ret2|)} is VALID [2020-07-28 17:54:27,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {187#(<= 2 |ULTIMATE.start_fmax_float_#t~ret2|)} assume 0 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {185#false} is VALID [2020-07-28 17:54:27,001 INFO L280 TraceCheckUtils]: 7: Hoare triple {185#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x, isnan_float_~x) then 1 else 0); {185#false} is VALID [2020-07-28 17:54:27,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {185#false} main_#t~ret6 := isnan_float_#res;assume -2147483648 <= main_#t~ret6 && main_#t~ret6 <= 2147483647; {185#false} is VALID [2020-07-28 17:54:27,001 INFO L280 TraceCheckUtils]: 9: Hoare triple {185#false} assume 0 == main_#t~ret6;havoc main_#t~ret6; {185#false} is VALID [2020-07-28 17:54:27,002 INFO L280 TraceCheckUtils]: 10: Hoare triple {185#false} assume !false; {185#false} is VALID [2020-07-28 17:54:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:27,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662423244] [2020-07-28 17:54:27,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:27,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:54:27,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922475674] [2020-07-28 17:54:27,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 17:54:27,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:27,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:54:27,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:27,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:54:27,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:27,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:54:27,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:54:27,033 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2020-07-28 17:54:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:27,224 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-07-28 17:54:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:54:27,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 17:54:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-28 17:54:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-28 17:54:27,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2020-07-28 17:54:27,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:27,312 INFO L225 Difference]: With dead ends: 41 [2020-07-28 17:54:27,312 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 17:54:27,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:54:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 17:54:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2020-07-28 17:54:27,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:27,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 27 states. [2020-07-28 17:54:27,323 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 27 states. [2020-07-28 17:54:27,323 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 27 states. [2020-07-28 17:54:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:27,327 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2020-07-28 17:54:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2020-07-28 17:54:27,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:27,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:27,328 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 36 states. [2020-07-28 17:54:27,329 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 36 states. [2020-07-28 17:54:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:27,332 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2020-07-28 17:54:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2020-07-28 17:54:27,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:27,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:27,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:27,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 17:54:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-28 17:54:27,336 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-07-28 17:54:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:27,337 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-28 17:54:27,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:54:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-28 17:54:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:54:27,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:27,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:27,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:54:27,339 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2020-07-28 17:54:27,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:27,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806000057] [2020-07-28 17:54:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:27,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {351#true} is VALID [2020-07-28 17:54:27,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {351#true} is VALID [2020-07-28 17:54:27,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {351#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);call __fpclassify_float_#t~mem0 := read~int(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~real(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);havoc __fpclassify_float_#t~union1;havoc __fpclassify_float_#t~mem0;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {351#true} is VALID [2020-07-28 17:54:27,437 INFO L280 TraceCheckUtils]: 3: Hoare triple {351#true} goto; {351#true} is VALID [2020-07-28 17:54:27,437 INFO L280 TraceCheckUtils]: 4: Hoare triple {351#true} assume !(0 == __fpclassify_float_~w~0 % 4294967296 || 2147483648 == __fpclassify_float_~w~0 % 4294967296); {351#true} is VALID [2020-07-28 17:54:27,438 INFO L280 TraceCheckUtils]: 5: Hoare triple {351#true} assume !((__fpclassify_float_~w~0 % 4294967296 >= 8388608 && __fpclassify_float_~w~0 % 4294967296 <= 2139095039) || (__fpclassify_float_~w~0 % 4294967296 >= 2155872256 && __fpclassify_float_~w~0 % 4294967296 <= 4286578687)); {351#true} is VALID [2020-07-28 17:54:27,438 INFO L280 TraceCheckUtils]: 6: Hoare triple {351#true} assume !((__fpclassify_float_~w~0 % 4294967296 >= 1 && __fpclassify_float_~w~0 % 4294967296 <= 8388607) || (__fpclassify_float_~w~0 % 4294967296 >= 2147483649 && __fpclassify_float_~w~0 % 4294967296 <= 2155872255)); {351#true} is VALID [2020-07-28 17:54:27,440 INFO L280 TraceCheckUtils]: 7: Hoare triple {351#true} assume 2139095040 == __fpclassify_float_~w~0 % 4294967296 || 4286578688 == __fpclassify_float_~w~0 % 4294967296;__fpclassify_float_#res := 1; {353#(<= 1 |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:27,441 INFO L280 TraceCheckUtils]: 8: Hoare triple {353#(<= 1 |ULTIMATE.start___fpclassify_float_#res|)} fmax_float_#t~ret2 := __fpclassify_float_#res;assume -2147483648 <= fmax_float_#t~ret2 && fmax_float_#t~ret2 <= 2147483647; {354#(<= 1 |ULTIMATE.start_fmax_float_#t~ret2|)} is VALID [2020-07-28 17:54:27,442 INFO L280 TraceCheckUtils]: 9: Hoare triple {354#(<= 1 |ULTIMATE.start_fmax_float_#t~ret2|)} assume 0 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {352#false} is VALID [2020-07-28 17:54:27,442 INFO L280 TraceCheckUtils]: 10: Hoare triple {352#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x, isnan_float_~x) then 1 else 0); {352#false} is VALID [2020-07-28 17:54:27,443 INFO L280 TraceCheckUtils]: 11: Hoare triple {352#false} main_#t~ret6 := isnan_float_#res;assume -2147483648 <= main_#t~ret6 && main_#t~ret6 <= 2147483647; {352#false} is VALID [2020-07-28 17:54:27,443 INFO L280 TraceCheckUtils]: 12: Hoare triple {352#false} assume 0 == main_#t~ret6;havoc main_#t~ret6; {352#false} is VALID [2020-07-28 17:54:27,444 INFO L280 TraceCheckUtils]: 13: Hoare triple {352#false} assume !false; {352#false} is VALID [2020-07-28 17:54:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:27,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806000057] [2020-07-28 17:54:27,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:27,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:54:27,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248308844] [2020-07-28 17:54:27,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 17:54:27,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:27,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:54:27,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:27,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:54:27,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:54:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:54:27,474 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-07-28 17:54:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:27,642 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-07-28 17:54:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:54:27,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 17:54:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-28 17:54:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-28 17:54:27,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2020-07-28 17:54:27,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:27,717 INFO L225 Difference]: With dead ends: 43 [2020-07-28 17:54:27,717 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 17:54:27,718 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:54:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 17:54:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-07-28 17:54:27,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:27,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 27 states. [2020-07-28 17:54:27,727 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 27 states. [2020-07-28 17:54:27,728 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 27 states. [2020-07-28 17:54:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:27,731 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-28 17:54:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2020-07-28 17:54:27,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:27,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:27,732 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 38 states. [2020-07-28 17:54:27,732 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 38 states. [2020-07-28 17:54:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:27,735 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-28 17:54:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2020-07-28 17:54:27,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:27,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:27,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:27,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 17:54:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-28 17:54:27,739 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2020-07-28 17:54:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:27,739 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-28 17:54:27,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:54:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-28 17:54:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:54:27,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:27,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:27,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:54:27,741 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-07-28 17:54:27,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:27,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743436045] [2020-07-28 17:54:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:27,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:27,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:28,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:54:28,009 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2112) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:401) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:375) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:384) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:343) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) 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:317) 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) [2020-07-28 17:54:28,016 INFO L168 Benchmark]: Toolchain (without parser) took 2898.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 960.2 MB in the beginning and 901.8 MB in the end (delta: 58.5 MB). Peak memory consumption was 162.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:28,016 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:28,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:28,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:28,019 INFO L168 Benchmark]: Boogie Preprocessor took 42.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:28,020 INFO L168 Benchmark]: RCFGBuilder took 678.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:28,020 INFO L168 Benchmark]: TraceAbstraction took 1759.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 901.8 MB in the end (delta: 157.2 MB). Peak memory consumption was 157.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:28,025 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 678.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1759.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 901.8 MB in the end (delta: 157.2 MB). Peak memory consumption was 157.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:54:30,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:54:30,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:54:30,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:54:30,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:54:30,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:54:30,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:54:30,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:54:30,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:54:30,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:54:30,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:54:30,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:54:30,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:54:30,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:54:30,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:54:30,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:54:30,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:54:30,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:54:30,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:54:30,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:54:30,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:54:30,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:54:30,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:54:30,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:54:30,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:54:30,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:54:30,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:54:30,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:54:30,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:54:30,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:54:30,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:54:30,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:54:30,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:54:30,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:54:30,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:54:30,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:54:30,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:54:30,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:54:30,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:54:30,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:54:30,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:54:30,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:54:30,106 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:54:30,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:54:30,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:54:30,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:54:30,108 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:54:30,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:54:30,109 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:54:30,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:54:30,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:54:30,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:54:30,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:54:30,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:54:30,111 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:54:30,111 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:54:30,111 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:54:30,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:54:30,112 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:54:30,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:54:30,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:54:30,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:54:30,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:54:30,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:54:30,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:30,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:54:30,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:54:30,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:54:30,115 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:54:30,115 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:54:30,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:54:30,116 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:54:30,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:54:30,116 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 [2020-07-28 17:54:30,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:54:30,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:54:30,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:54:30,441 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:54:30,441 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:54:30,442 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2020-07-28 17:54:30,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f729a2ea5/bad98e4039ad4e9b835fba0985102b8e/FLAG4bb8457bd [2020-07-28 17:54:30,951 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:54:30,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1250.c [2020-07-28 17:54:30,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f729a2ea5/bad98e4039ad4e9b835fba0985102b8e/FLAG4bb8457bd [2020-07-28 17:54:31,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f729a2ea5/bad98e4039ad4e9b835fba0985102b8e [2020-07-28 17:54:31,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:54:31,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:54:31,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:31,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:54:31,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:54:31,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a41d157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31, skipping insertion in model container [2020-07-28 17:54:31,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:54:31,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:54:31,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:31,570 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:54:31,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:31,707 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:54:31,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31 WrapperNode [2020-07-28 17:54:31,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:31,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:31,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:54:31,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:54:31,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:31,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:54:31,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:54:31,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:54:31,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... [2020-07-28 17:54:31,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:54:31,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:54:31,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:54:31,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:54:31,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:54:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:54:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:54:31,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:54:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-07-28 17:54:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:54:32,386 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:54:32,386 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:54:32,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:32 BoogieIcfgContainer [2020-07-28 17:54:32,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:54:32,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:54:32,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:54:32,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:54:32,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:54:31" (1/3) ... [2020-07-28 17:54:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b99114e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:32, skipping insertion in model container [2020-07-28 17:54:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:31" (2/3) ... [2020-07-28 17:54:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b99114e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:32, skipping insertion in model container [2020-07-28 17:54:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:32" (3/3) ... [2020-07-28 17:54:32,398 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2020-07-28 17:54:32,408 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:54:32,416 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:54:32,426 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:54:32,445 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:54:32,446 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:54:32,446 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:54:32,446 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:54:32,446 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:54:32,446 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:54:32,446 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:54:32,446 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:54:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-28 17:54:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:54:32,465 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:32,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:32,467 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-07-28 17:54:32,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:32,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866196429] [2020-07-28 17:54:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:32,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:54:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:32,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:32,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {31#true} is VALID [2020-07-28 17:54:32,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {31#true} is VALID [2020-07-28 17:54:32,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2020-07-28 17:54:32,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#false} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {32#false} is VALID [2020-07-28 17:54:32,629 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#false} fmax_float_#t~ret2 := __fpclassify_float_#res; {32#false} is VALID [2020-07-28 17:54:32,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#false} assume 0bv32 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {32#false} is VALID [2020-07-28 17:54:32,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {32#false} is VALID [2020-07-28 17:54:32,630 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} main_#t~ret6 := isnan_float_#res; {32#false} is VALID [2020-07-28 17:54:32,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {32#false} is VALID [2020-07-28 17:54:32,631 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 17:54:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:32,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:32,649 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 17:54:32,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {32#false} is VALID [2020-07-28 17:54:32,650 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} main_#t~ret6 := isnan_float_#res; {32#false} is VALID [2020-07-28 17:54:32,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {32#false} is VALID [2020-07-28 17:54:32,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#false} assume 0bv32 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {32#false} is VALID [2020-07-28 17:54:32,651 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#false} fmax_float_#t~ret2 := __fpclassify_float_#res; {32#false} is VALID [2020-07-28 17:54:32,652 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#false} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {32#false} is VALID [2020-07-28 17:54:32,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2020-07-28 17:54:32,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {31#true} is VALID [2020-07-28 17:54:32,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {31#true} is VALID [2020-07-28 17:54:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:32,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866196429] [2020-07-28 17:54:32,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:32,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:54:32,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614167904] [2020-07-28 17:54:32,664 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:32,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:32,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:54:32,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:32,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:54:32,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:54:32,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:32,705 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-28 17:54:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:32,809 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-07-28 17:54:32,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:54:32,810 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:54:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:54:32,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2020-07-28 17:54:32,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:32,986 INFO L225 Difference]: With dead ends: 54 [2020-07-28 17:54:32,986 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 17:54:32,990 INFO L675 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 [2020-07-28 17:54:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 17:54:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-28 17:54:33,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:33,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:33,028 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:33,028 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:33,032 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-28 17:54:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-28 17:54:33,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:33,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:33,034 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:33,034 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:54:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:33,038 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-28 17:54:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-28 17:54:33,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:33,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:33,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:33,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 17:54:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-07-28 17:54:33,044 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-07-28 17:54:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:33,044 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-07-28 17:54:33,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:54:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-28 17:54:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:54:33,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:33,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:33,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:54:33,260 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-07-28 17:54:33,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:33,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12067056] [2020-07-28 17:54:33,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:33,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:54:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:33,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:33,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {238#true} is VALID [2020-07-28 17:54:33,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {238#true} is VALID [2020-07-28 17:54:33,399 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {238#true} is VALID [2020-07-28 17:54:33,399 INFO L280 TraceCheckUtils]: 3: Hoare triple {238#true} goto; {238#true} is VALID [2020-07-28 17:54:33,400 INFO L280 TraceCheckUtils]: 4: Hoare triple {238#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {255#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:33,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {255#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} fmax_float_#t~ret2 := __fpclassify_float_#res; {259#(= (_ bv2 32) |ULTIMATE.start_fmax_float_#t~ret2|)} is VALID [2020-07-28 17:54:33,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {259#(= (_ bv2 32) |ULTIMATE.start_fmax_float_#t~ret2|)} assume 0bv32 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {239#false} is VALID [2020-07-28 17:54:33,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {239#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {239#false} is VALID [2020-07-28 17:54:33,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {239#false} main_#t~ret6 := isnan_float_#res; {239#false} is VALID [2020-07-28 17:54:33,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {239#false} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {239#false} is VALID [2020-07-28 17:54:33,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {239#false} assume !false; {239#false} is VALID [2020-07-28 17:54:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:33,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:33,445 INFO L280 TraceCheckUtils]: 10: Hoare triple {239#false} assume !false; {239#false} is VALID [2020-07-28 17:54:33,445 INFO L280 TraceCheckUtils]: 9: Hoare triple {239#false} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {239#false} is VALID [2020-07-28 17:54:33,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {239#false} main_#t~ret6 := isnan_float_#res; {239#false} is VALID [2020-07-28 17:54:33,446 INFO L280 TraceCheckUtils]: 7: Hoare triple {239#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {239#false} is VALID [2020-07-28 17:54:33,447 INFO L280 TraceCheckUtils]: 6: Hoare triple {287#(not (= (_ bv0 32) |ULTIMATE.start_fmax_float_#t~ret2|))} assume 0bv32 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {239#false} is VALID [2020-07-28 17:54:33,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {291#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} fmax_float_#t~ret2 := __fpclassify_float_#res; {287#(not (= (_ bv0 32) |ULTIMATE.start_fmax_float_#t~ret2|))} is VALID [2020-07-28 17:54:33,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {238#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {291#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} is VALID [2020-07-28 17:54:33,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {238#true} goto; {238#true} is VALID [2020-07-28 17:54:33,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {238#true} is VALID [2020-07-28 17:54:33,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {238#true} is VALID [2020-07-28 17:54:33,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {238#true} is VALID [2020-07-28 17:54:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:33,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12067056] [2020-07-28 17:54:33,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:33,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:54:33,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087302641] [2020-07-28 17:54:33,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 17:54:33,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:33,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:54:33,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:33,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:54:33,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:33,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:54:33,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:54:33,489 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 6 states. [2020-07-28 17:54:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:33,941 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2020-07-28 17:54:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:54:33,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 17:54:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2020-07-28 17:54:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2020-07-28 17:54:33,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2020-07-28 17:54:34,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:34,054 INFO L225 Difference]: With dead ends: 52 [2020-07-28 17:54:34,054 INFO L226 Difference]: Without dead ends: 47 [2020-07-28 17:54:34,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:54:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-28 17:54:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-07-28 17:54:34,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:34,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 27 states. [2020-07-28 17:54:34,066 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 27 states. [2020-07-28 17:54:34,066 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 27 states. [2020-07-28 17:54:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:34,070 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2020-07-28 17:54:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2020-07-28 17:54:34,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:34,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:34,071 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 47 states. [2020-07-28 17:54:34,071 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 47 states. [2020-07-28 17:54:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:34,075 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2020-07-28 17:54:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2020-07-28 17:54:34,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:34,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:34,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:34,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 17:54:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-28 17:54:34,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-07-28 17:54:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:34,080 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-28 17:54:34,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:54:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-28 17:54:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:54:34,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:34,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:34,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:54:34,296 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:34,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-07-28 17:54:34,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:34,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759253235] [2020-07-28 17:54:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:34,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 17:54:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:34,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:34,480 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:54:34,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {506#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {506#true} is VALID [2020-07-28 17:54:34,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {506#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,550 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,553 INFO L280 TraceCheckUtils]: 6: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,555 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} fmax_float_#t~ret2 := __fpclassify_float_#res; {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,556 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {539#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:34,559 INFO L280 TraceCheckUtils]: 10: Hoare triple {539#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {543#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} is VALID [2020-07-28 17:54:34,561 INFO L280 TraceCheckUtils]: 11: Hoare triple {543#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} main_#t~ret6 := isnan_float_#res; {547#(= (bvadd |ULTIMATE.start_main_#t~ret6| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 17:54:34,562 INFO L280 TraceCheckUtils]: 12: Hoare triple {547#(= (bvadd |ULTIMATE.start_main_#t~ret6| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {507#false} is VALID [2020-07-28 17:54:34,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {507#false} assume !false; {507#false} is VALID [2020-07-28 17:54:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:34,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:34,698 INFO L280 TraceCheckUtils]: 13: Hoare triple {507#false} assume !false; {507#false} is VALID [2020-07-28 17:54:34,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {557#(not (= |ULTIMATE.start_main_#t~ret6| (_ bv0 32)))} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {507#false} is VALID [2020-07-28 17:54:34,700 INFO L280 TraceCheckUtils]: 11: Hoare triple {561#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} main_#t~ret6 := isnan_float_#res; {557#(not (= |ULTIMATE.start_main_#t~ret6| (_ bv0 32)))} is VALID [2020-07-28 17:54:34,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {565#(not (fp.eq |ULTIMATE.start_fmax_float_#res| |ULTIMATE.start_fmax_float_#res|))} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {561#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} is VALID [2020-07-28 17:54:34,702 INFO L280 TraceCheckUtils]: 9: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume 0bv32 == fmax_float_#t~ret2;havoc fmax_float_#t~ret2;fmax_float_#res := fmax_float_~y; {565#(not (fp.eq |ULTIMATE.start_fmax_float_#res| |ULTIMATE.start_fmax_float_#res|))} is VALID [2020-07-28 17:54:34,703 INFO L280 TraceCheckUtils]: 8: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} fmax_float_#t~ret2 := __fpclassify_float_#res; {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,706 INFO L280 TraceCheckUtils]: 5: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,707 INFO L280 TraceCheckUtils]: 3: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} goto; {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {506#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {569#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:34,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {506#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {506#true} is VALID [2020-07-28 17:54:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:34,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759253235] [2020-07-28 17:54:34,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:34,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-07-28 17:54:34,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129051560] [2020-07-28 17:54:34,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-07-28 17:54:34,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:34,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 17:54:34,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:34,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 17:54:34,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:34,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 17:54:34,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:54:34,776 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 10 states. [2020-07-28 17:54:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:35,674 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-28 17:54:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:54:35,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-07-28 17:54:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:54:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-28 17:54:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:54:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-28 17:54:35,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-28 17:54:35,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:35,777 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:54:35,778 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 17:54:35,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:54:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 17:54:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-28 17:54:35,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:35,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-28 17:54:35,787 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-28 17:54:35,787 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-28 17:54:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:35,790 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-28 17:54:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-28 17:54:35,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:35,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:35,791 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-28 17:54:35,791 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-28 17:54:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:35,793 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-28 17:54:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-28 17:54:35,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:35,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:35,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:35,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 17:54:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-28 17:54:35,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2020-07-28 17:54:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:35,796 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-28 17:54:35,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 17:54:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-07-28 17:54:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 17:54:35,797 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:35,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:36,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:54:36,005 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:36,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:36,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2020-07-28 17:54:36,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:36,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117526956] [2020-07-28 17:54:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:36,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:54:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:36,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:36,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {735#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {735#true} is VALID [2020-07-28 17:54:36,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {735#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {735#true} is VALID [2020-07-28 17:54:36,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {735#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {735#true} is VALID [2020-07-28 17:54:36,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {735#true} goto; {735#true} is VALID [2020-07-28 17:54:36,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {735#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {735#true} is VALID [2020-07-28 17:54:36,108 INFO L280 TraceCheckUtils]: 5: Hoare triple {735#true} fmax_float_#t~ret2 := __fpclassify_float_#res; {735#true} is VALID [2020-07-28 17:54:36,108 INFO L280 TraceCheckUtils]: 6: Hoare triple {735#true} assume !(0bv32 == fmax_float_#t~ret2);havoc fmax_float_#t~ret2;__fpclassify_float_#in~x := fmax_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {735#true} is VALID [2020-07-28 17:54:36,109 INFO L280 TraceCheckUtils]: 7: Hoare triple {735#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {735#true} is VALID [2020-07-28 17:54:36,109 INFO L280 TraceCheckUtils]: 8: Hoare triple {735#true} goto; {735#true} is VALID [2020-07-28 17:54:36,110 INFO L280 TraceCheckUtils]: 9: Hoare triple {735#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {767#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:36,110 INFO L280 TraceCheckUtils]: 10: Hoare triple {767#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} fmax_float_#t~ret3 := __fpclassify_float_#res; {771#(= (_ bv2 32) |ULTIMATE.start_fmax_float_#t~ret3|)} is VALID [2020-07-28 17:54:36,111 INFO L280 TraceCheckUtils]: 11: Hoare triple {771#(= (_ bv2 32) |ULTIMATE.start_fmax_float_#t~ret3|)} assume 0bv32 == fmax_float_#t~ret3;havoc fmax_float_#t~ret3;fmax_float_#res := fmax_float_~x; {736#false} is VALID [2020-07-28 17:54:36,111 INFO L280 TraceCheckUtils]: 12: Hoare triple {736#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {736#false} is VALID [2020-07-28 17:54:36,111 INFO L280 TraceCheckUtils]: 13: Hoare triple {736#false} main_#t~ret6 := isnan_float_#res; {736#false} is VALID [2020-07-28 17:54:36,112 INFO L280 TraceCheckUtils]: 14: Hoare triple {736#false} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {736#false} is VALID [2020-07-28 17:54:36,112 INFO L280 TraceCheckUtils]: 15: Hoare triple {736#false} assume !false; {736#false} is VALID [2020-07-28 17:54:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:36,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:36,147 INFO L280 TraceCheckUtils]: 15: Hoare triple {736#false} assume !false; {736#false} is VALID [2020-07-28 17:54:36,148 INFO L280 TraceCheckUtils]: 14: Hoare triple {736#false} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {736#false} is VALID [2020-07-28 17:54:36,148 INFO L280 TraceCheckUtils]: 13: Hoare triple {736#false} main_#t~ret6 := isnan_float_#res; {736#false} is VALID [2020-07-28 17:54:36,149 INFO L280 TraceCheckUtils]: 12: Hoare triple {736#false} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {736#false} is VALID [2020-07-28 17:54:36,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {799#(not (= (_ bv0 32) |ULTIMATE.start_fmax_float_#t~ret3|))} assume 0bv32 == fmax_float_#t~ret3;havoc fmax_float_#t~ret3;fmax_float_#res := fmax_float_~x; {736#false} is VALID [2020-07-28 17:54:36,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {803#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} fmax_float_#t~ret3 := __fpclassify_float_#res; {799#(not (= (_ bv0 32) |ULTIMATE.start_fmax_float_#t~ret3|))} is VALID [2020-07-28 17:54:36,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {735#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {803#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} is VALID [2020-07-28 17:54:36,151 INFO L280 TraceCheckUtils]: 8: Hoare triple {735#true} goto; {735#true} is VALID [2020-07-28 17:54:36,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {735#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {735#true} is VALID [2020-07-28 17:54:36,152 INFO L280 TraceCheckUtils]: 6: Hoare triple {735#true} assume !(0bv32 == fmax_float_#t~ret2);havoc fmax_float_#t~ret2;__fpclassify_float_#in~x := fmax_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {735#true} is VALID [2020-07-28 17:54:36,152 INFO L280 TraceCheckUtils]: 5: Hoare triple {735#true} fmax_float_#t~ret2 := __fpclassify_float_#res; {735#true} is VALID [2020-07-28 17:54:36,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {735#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {735#true} is VALID [2020-07-28 17:54:36,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {735#true} goto; {735#true} is VALID [2020-07-28 17:54:36,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {735#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {735#true} is VALID [2020-07-28 17:54:36,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {735#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {735#true} is VALID [2020-07-28 17:54:36,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {735#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {735#true} is VALID [2020-07-28 17:54:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:36,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117526956] [2020-07-28 17:54:36,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:36,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:54:36,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755537114] [2020-07-28 17:54:36,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-28 17:54:36,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:36,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:54:36,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:36,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:54:36,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:54:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:54:36,188 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 6 states. [2020-07-28 17:54:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:36,572 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-28 17:54:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:54:36,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-28 17:54:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-28 17:54:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-28 17:54:36,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-28 17:54:36,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:36,674 INFO L225 Difference]: With dead ends: 52 [2020-07-28 17:54:36,675 INFO L226 Difference]: Without dead ends: 47 [2020-07-28 17:54:36,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:54:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-28 17:54:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-07-28 17:54:36,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:36,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 27 states. [2020-07-28 17:54:36,687 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 27 states. [2020-07-28 17:54:36,688 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 27 states. [2020-07-28 17:54:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:36,690 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-28 17:54:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-28 17:54:36,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:36,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:36,691 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 47 states. [2020-07-28 17:54:36,691 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 47 states. [2020-07-28 17:54:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:36,693 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-28 17:54:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-28 17:54:36,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:36,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:36,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:36,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 17:54:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-07-28 17:54:36,696 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2020-07-28 17:54:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:36,697 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-28 17:54:36,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:54:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-28 17:54:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 17:54:36,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:36,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:36,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:54:36,912 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2020-07-28 17:54:36,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:36,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113108623] [2020-07-28 17:54:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:36,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-28 17:54:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:36,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:37,129 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:54:37,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {1033#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1033#true} is VALID [2020-07-28 17:54:37,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,203 INFO L280 TraceCheckUtils]: 3: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,204 INFO L280 TraceCheckUtils]: 4: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} fmax_float_#t~ret2 := __fpclassify_float_#res; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,210 INFO L280 TraceCheckUtils]: 6: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret2);havoc fmax_float_#t~ret2;__fpclassify_float_#in~x := fmax_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,211 INFO L280 TraceCheckUtils]: 8: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,212 INFO L280 TraceCheckUtils]: 10: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} fmax_float_#t~ret3 := __fpclassify_float_#res; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret3);havoc fmax_float_#t~ret3; {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {1041#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !~fp.gt~FLOAT(fmax_float_~x, fmax_float_~y);fmax_float_#t~ite4 := fmax_float_~y; {1075#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#t~ite4| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,214 INFO L280 TraceCheckUtils]: 13: Hoare triple {1075#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#t~ite4| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} fmax_float_#res := fmax_float_#t~ite4;havoc fmax_float_#t~ite4; {1079#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:37,216 INFO L280 TraceCheckUtils]: 14: Hoare triple {1079#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {1083#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} is VALID [2020-07-28 17:54:37,217 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} main_#t~ret6 := isnan_float_#res; {1087#(= (bvadd |ULTIMATE.start_main_#t~ret6| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 17:54:37,217 INFO L280 TraceCheckUtils]: 16: Hoare triple {1087#(= (bvadd |ULTIMATE.start_main_#t~ret6| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {1034#false} is VALID [2020-07-28 17:54:37,217 INFO L280 TraceCheckUtils]: 17: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2020-07-28 17:54:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:37,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:37,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2020-07-28 17:54:37,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {1097#(not (= |ULTIMATE.start_main_#t~ret6| (_ bv0 32)))} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {1034#false} is VALID [2020-07-28 17:54:37,384 INFO L280 TraceCheckUtils]: 15: Hoare triple {1101#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} main_#t~ret6 := isnan_float_#res; {1097#(not (= |ULTIMATE.start_main_#t~ret6| (_ bv0 32)))} is VALID [2020-07-28 17:54:37,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {1105#(not (fp.eq |ULTIMATE.start_fmax_float_#res| |ULTIMATE.start_fmax_float_#res|))} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {1101#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} is VALID [2020-07-28 17:54:37,389 INFO L280 TraceCheckUtils]: 13: Hoare triple {1109#(not (fp.eq |ULTIMATE.start_fmax_float_#t~ite4| |ULTIMATE.start_fmax_float_#t~ite4|))} fmax_float_#res := fmax_float_#t~ite4;havoc fmax_float_#t~ite4; {1105#(not (fp.eq |ULTIMATE.start_fmax_float_#res| |ULTIMATE.start_fmax_float_#res|))} is VALID [2020-07-28 17:54:37,393 INFO L280 TraceCheckUtils]: 12: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume !~fp.gt~FLOAT(fmax_float_~x, fmax_float_~y);fmax_float_#t~ite4 := fmax_float_~y; {1109#(not (fp.eq |ULTIMATE.start_fmax_float_#t~ite4| |ULTIMATE.start_fmax_float_#t~ite4|))} is VALID [2020-07-28 17:54:37,394 INFO L280 TraceCheckUtils]: 11: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume !(0bv32 == fmax_float_#t~ret3);havoc fmax_float_#t~ret3; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} fmax_float_#t~ret3 := __fpclassify_float_#res; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} goto; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,400 INFO L280 TraceCheckUtils]: 6: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume !(0bv32 == fmax_float_#t~ret2);havoc fmax_float_#t~ret2;__fpclassify_float_#in~x := fmax_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} fmax_float_#t~ret2 := __fpclassify_float_#res; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,402 INFO L280 TraceCheckUtils]: 3: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} goto; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {1033#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1113#(not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))} is VALID [2020-07-28 17:54:37,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {1033#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1033#true} is VALID [2020-07-28 17:54:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:37,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113108623] [2020-07-28 17:54:37,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:37,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-07-28 17:54:37,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482897731] [2020-07-28 17:54:37,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-07-28 17:54:37,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:37,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 17:54:37,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:37,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 17:54:37,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:37,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 17:54:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:54:37,477 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 12 states. [2020-07-28 17:54:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:38,358 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-28 17:54:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 17:54:38,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-07-28 17:54:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 17:54:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-28 17:54:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 17:54:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-28 17:54:38,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2020-07-28 17:54:38,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:38,455 INFO L225 Difference]: With dead ends: 32 [2020-07-28 17:54:38,455 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 17:54:38,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-07-28 17:54:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 17:54:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-28 17:54:38,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:38,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:38,471 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:38,471 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:38,472 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-28 17:54:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-28 17:54:38,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:38,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:38,472 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:38,473 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:38,473 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-28 17:54:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-28 17:54:38,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:38,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:38,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:38,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 17:54:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-28 17:54:38,475 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2020-07-28 17:54:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:38,476 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-28 17:54:38,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 17:54:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-28 17:54:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:54:38,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:38,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:38,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 17:54:38,685 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:38,686 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2020-07-28 17:54:38,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:38,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689346966] [2020-07-28 17:54:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:38,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 17:54:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:38,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:38,871 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:54:38,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1274#true} is VALID [2020-07-28 17:54:38,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {1274#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,919 INFO L280 TraceCheckUtils]: 3: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,921 INFO L280 TraceCheckUtils]: 5: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} fmax_float_#t~ret2 := __fpclassify_float_#res; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,921 INFO L280 TraceCheckUtils]: 6: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmax_float_#t~ret2);havoc fmax_float_#t~ret2;__fpclassify_float_#in~x := fmax_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,922 INFO L280 TraceCheckUtils]: 7: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,923 INFO L280 TraceCheckUtils]: 8: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,923 INFO L280 TraceCheckUtils]: 9: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,924 INFO L280 TraceCheckUtils]: 10: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,925 INFO L280 TraceCheckUtils]: 11: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,925 INFO L280 TraceCheckUtils]: 12: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,926 INFO L280 TraceCheckUtils]: 13: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} fmax_float_#t~ret3 := __fpclassify_float_#res; {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,927 INFO L280 TraceCheckUtils]: 14: Hoare triple {1282#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == fmax_float_#t~ret3;havoc fmax_float_#t~ret3;fmax_float_#res := fmax_float_~x; {1322#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:38,929 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {1326#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} is VALID [2020-07-28 17:54:38,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {1326#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} main_#t~ret6 := isnan_float_#res; {1330#(= (bvadd |ULTIMATE.start_main_#t~ret6| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 17:54:38,931 INFO L280 TraceCheckUtils]: 17: Hoare triple {1330#(= (bvadd |ULTIMATE.start_main_#t~ret6| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {1275#false} is VALID [2020-07-28 17:54:38,931 INFO L280 TraceCheckUtils]: 18: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2020-07-28 17:54:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:38,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:39,048 INFO L280 TraceCheckUtils]: 18: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2020-07-28 17:54:39,048 INFO L280 TraceCheckUtils]: 17: Hoare triple {1340#(not (= |ULTIMATE.start_main_#t~ret6| (_ bv0 32)))} assume 0bv32 == main_#t~ret6;havoc main_#t~ret6; {1275#false} is VALID [2020-07-28 17:54:39,049 INFO L280 TraceCheckUtils]: 16: Hoare triple {1344#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} main_#t~ret6 := isnan_float_#res; {1340#(not (= |ULTIMATE.start_main_#t~ret6| (_ bv0 32)))} is VALID [2020-07-28 17:54:39,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {1348#(not (fp.eq |ULTIMATE.start_fmax_float_#res| |ULTIMATE.start_fmax_float_#res|))} main_#t~ret5 := fmax_float_#res;main_~res~0 := main_#t~ret5;havoc main_#t~ret5;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {1344#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} is VALID [2020-07-28 17:54:39,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} assume 0bv32 == fmax_float_#t~ret3;havoc fmax_float_#t~ret3;fmax_float_#res := fmax_float_~x; {1348#(not (fp.eq |ULTIMATE.start_fmax_float_#res| |ULTIMATE.start_fmax_float_#res|))} is VALID [2020-07-28 17:54:39,051 INFO L280 TraceCheckUtils]: 13: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} fmax_float_#t~ret3 := __fpclassify_float_#res; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,052 INFO L280 TraceCheckUtils]: 10: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,053 INFO L280 TraceCheckUtils]: 9: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,053 INFO L280 TraceCheckUtils]: 8: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} goto; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} assume !(0bv32 == fmax_float_#t~ret2);havoc fmax_float_#t~ret2;__fpclassify_float_#in~x := fmax_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} fmax_float_#t~ret2 := __fpclassify_float_#res; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,056 INFO L280 TraceCheckUtils]: 4: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} goto; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,057 INFO L280 TraceCheckUtils]: 2: Hoare triple {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {1274#true} havoc main_#res;havoc main_#t~ret5, main_#t~ret6, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());fmax_float_#in~x, fmax_float_#in~y := main_~x~0, main_~y~0;havoc fmax_float_#res;havoc fmax_float_#t~ret2, fmax_float_#t~ret3, fmax_float_#t~ite4, fmax_float_~x, fmax_float_~y;fmax_float_~x := fmax_float_#in~x;fmax_float_~y := fmax_float_#in~y;__fpclassify_float_#in~x := fmax_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1352#(not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))} is VALID [2020-07-28 17:54:39,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {1274#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1274#true} is VALID [2020-07-28 17:54:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:39,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689346966] [2020-07-28 17:54:39,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:39,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-07-28 17:54:39,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142910788] [2020-07-28 17:54:39,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-28 17:54:39,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:39,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 17:54:39,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:39,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 17:54:39,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:39,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 17:54:39,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:54:39,133 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 10 states. [2020-07-28 17:54:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:39,686 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-28 17:54:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:54:39,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-28 17:54:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:54:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-28 17:54:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:54:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-28 17:54:39,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-28 17:54:39,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:39,744 INFO L225 Difference]: With dead ends: 23 [2020-07-28 17:54:39,744 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:54:39,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:54:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:54:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:54:39,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:39,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:54:39,746 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:54:39,746 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:54:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:39,746 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:54:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:54:39,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:39,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:39,747 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:54:39,747 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:54:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:39,747 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:54:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:54:39,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:39,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:39,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:39,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:54:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:54:39,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-28 17:54:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:39,749 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:54:39,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 17:54:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:54:39,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:39,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 17:54:39,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:54:40,291 INFO L268 CegarLoopResult]: For program point L64(lines 64 67) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L271 CegarLoopResult]: At program point L69(lines 56 70) the Hoare annotation is: true [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point L36(lines 36 39) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point L36-1(lines 36 39) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2020-07-28 17:54:40,292 INFO L268 CegarLoopResult]: For program point L33(lines 33 39) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L268 CegarLoopResult]: For program point L33-1(lines 33 39) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2020-07-28 17:54:40,293 INFO L268 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L268 CegarLoopResult]: For program point L50-2(line 50) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L264 CegarLoopResult]: At program point L50-3(lines 42 51) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_fmax_float_~y (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2020-07-28 17:54:40,293 INFO L268 CegarLoopResult]: For program point L30(lines 30 39) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L268 CegarLoopResult]: For program point L30-1(lines 30 39) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L268 CegarLoopResult]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2020-07-28 17:54:40,293 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))) [2020-07-28 17:54:40,294 INFO L268 CegarLoopResult]: For program point L22-3(lines 19 40) no Hoare annotation was computed. [2020-07-28 17:54:40,294 INFO L268 CegarLoopResult]: For program point L22-5(lines 22 26) no Hoare annotation was computed. [2020-07-28 17:54:40,294 INFO L264 CegarLoopResult]: At program point L22-6(lines 22 26) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))) [2020-07-28 17:54:40,294 INFO L268 CegarLoopResult]: For program point L22-7(lines 19 40) no Hoare annotation was computed. [2020-07-28 17:54:40,294 INFO L268 CegarLoopResult]: For program point L47(lines 47 49) no Hoare annotation was computed. [2020-07-28 17:54:40,294 INFO L268 CegarLoopResult]: For program point L43(lines 43 45) no Hoare annotation was computed. [2020-07-28 17:54:40,294 INFO L264 CegarLoopResult]: At program point L39(lines 19 40) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))) [2020-07-28 17:54:40,294 INFO L264 CegarLoopResult]: At program point L39-1(lines 19 40) the Hoare annotation is: (let ((.cse0 (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)))) (or (and .cse0 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))))) [2020-07-28 17:54:40,298 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:54:40,298 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-28 17:54:40,299 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-28 17:54:40,300 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 17:54:40,300 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 17:54:40,303 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-28 17:54:40,303 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-28 17:54:40,304 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-28 17:54:40,305 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:54:40,306 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:54:40,306 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:54:40,306 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-28 17:54:40,306 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-28 17:54:40,306 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-28 17:54:40,306 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:54:40,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:54:40 BoogieIcfgContainer [2020-07-28 17:54:40,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:54:40,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:54:40,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:54:40,339 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:54:40,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:32" (3/4) ... [2020-07-28 17:54:40,342 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:54:40,352 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-07-28 17:54:40,352 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-28 17:54:40,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:54:40,379 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2020-07-28 17:54:40,380 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2020-07-28 17:54:40,380 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(y, y) && !(0bv32 == \result)) || (!~fp.eq~FLOAT(y, y) && !~fp.eq~FLOAT(x, x)) [2020-07-28 17:54:40,417 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:54:40,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:54:40,420 INFO L168 Benchmark]: Toolchain (without parser) took 9119.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 950.8 MB in the beginning and 912.5 MB in the end (delta: 38.4 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:40,421 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:40,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:40,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:40,422 INFO L168 Benchmark]: Boogie Preprocessor took 39.47 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. [2020-07-28 17:54:40,428 INFO L168 Benchmark]: RCFGBuilder took 586.32 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:40,428 INFO L168 Benchmark]: TraceAbstraction took 7946.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 912.5 MB in the end (delta: 176.1 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:40,429 INFO L168 Benchmark]: Witness Printer took 79.29 ms. Allocated memory is still 1.2 GB. Free memory was 912.5 MB in the beginning and 912.5 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-28 17:54:40,433 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.47 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 586.32 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7946.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 912.5 MB in the end (delta: 176.1 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. * Witness Printer took 79.29 ms. Allocated memory is still 1.2 GB. Free memory was 912.5 MB in the beginning and 912.5 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 65]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant [2020-07-28 17:54:40,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: !~fp.eq~FLOAT(y, y) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 54]: Loop Invariant [2020-07-28 17:54:40,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:54:40,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (1bv32 == \result && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(y, y) && !(0bv32 == \result)) || (!~fp.eq~FLOAT(y, y) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: !~fp.eq~FLOAT(y, y) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: !~fp.eq~FLOAT(y, y) && !~fp.eq~FLOAT(x, x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 182 SDtfs, 127 SDslu, 509 SDs, 0 SdLazy, 128 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 19 NumberOfFragments, 80 HoareAnnotationTreeSize, 7 FomulaSimplifications, 190 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 45 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 164 ConstructedInterpolants, 36 QuantifiedInterpolants, 8512 SizeOfPredicates, 32 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...