/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1250.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:25,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:25,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:25,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:25,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:25,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:25,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:25,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:25,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:25,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:25,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:25,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:25,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:25,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:25,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:25,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:25,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:25,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:25,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:25,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:25,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:25,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:25,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:25,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:25,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:25,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:25,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:25,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:25,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:25,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:25,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:25,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:25,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:25,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:25,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:25,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:25,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:25,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:25,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:25,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:25,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:25,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:42:25,786 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:25,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:25,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:25,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:25,789 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:25,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:25,789 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:25,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:25,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:25,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:25,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:25,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:25,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:25,792 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:25,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:25,792 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:25,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:25,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:25,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:25,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:25,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:25,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:25,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:25,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:25,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:25,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:25,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:25,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:25,795 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:25,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:26,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:26,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:26,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:26,124 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:26,125 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:26,126 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1250.c [2020-07-10 14:42:26,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cf1feed/812bedea3c064d94802e559ec04003b5/FLAG7560eb1f3 [2020-07-10 14:42:26,713 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:26,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1250.c [2020-07-10 14:42:26,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cf1feed/812bedea3c064d94802e559ec04003b5/FLAG7560eb1f3 [2020-07-10 14:42:27,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cf1feed/812bedea3c064d94802e559ec04003b5 [2020-07-10 14:42:27,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:27,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:27,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:27,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:27,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:27,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f18f3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27, skipping insertion in model container [2020-07-10 14:42:27,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:27,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:27,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:27,304 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:27,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:27,446 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:27,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27 WrapperNode [2020-07-10 14:42:27,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:27,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:27,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:27,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:27,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (1/1) ... [2020-07-10 14:42:27,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:27,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:27,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:27,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:27,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (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-10 14:42:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-10 14:42:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-10 14:42:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-10 14:42:27,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:27,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-10 14:42:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:42:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:42:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:42:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:42:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-10 14:42:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-10 14:42:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:42:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:42:28,043 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:28,043 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 14:42:28,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:28 BoogieIcfgContainer [2020-07-10 14:42:28,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:28,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:28,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:28,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:28,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:27" (1/3) ... [2020-07-10 14:42:28,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cf560d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:28, skipping insertion in model container [2020-07-10 14:42:28,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:27" (2/3) ... [2020-07-10 14:42:28,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cf560d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:28, skipping insertion in model container [2020-07-10 14:42:28,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:28" (3/3) ... [2020-07-10 14:42:28,056 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250.c [2020-07-10 14:42:28,064 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:28,072 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:28,086 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:28,110 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:28,110 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:28,110 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:28,110 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:28,111 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:28,111 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:28,111 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:28,111 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 14:42:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:28,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:28,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:28,137 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1130060244, now seen corresponding path program 1 times [2020-07-10 14:42:28,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:28,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516506661] [2020-07-10 14:42:28,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:28,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 14:42:28,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:28,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-10 14:42:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:28,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-10 14:42:28,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:42:28,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-10 14:42:28,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:28,410 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:42:28,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-10 14:42:28,413 INFO L263 TraceCheckUtils]: 1: Hoare triple {43#true} call #t~ret2 := __fpclassify_float(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:28,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-10 14:42:28,415 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:42:28,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-10 14:42:28,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:28,416 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:42:28,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-10 14:42:28,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-10 14:42:28,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:28,418 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:42:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:28,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:42:28,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:28,432 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:42:28,433 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:28,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 14:42:28,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:28,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-10 14:42:28,435 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret7 := main(); {43#true} is VALID [2020-07-10 14:42:28,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {43#true} is VALID [2020-07-10 14:42:28,438 INFO L263 TraceCheckUtils]: 6: Hoare triple {43#true} call #t~ret5 := fmax_float(~x~0, ~y~0); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:28,438 INFO L280 TraceCheckUtils]: 7: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-10 14:42:28,440 INFO L263 TraceCheckUtils]: 8: Hoare triple {43#true} call #t~ret2 := __fpclassify_float(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:28,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-10 14:42:28,442 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:42:28,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-10 14:42:28,443 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:28,443 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:42:28,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-10 14:42:28,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-10 14:42:28,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:28,444 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:42:28,445 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~res~0 := #t~ret5;havoc #t~ret5; {44#false} is VALID [2020-07-10 14:42:28,445 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call #t~ret6 := isnan_float(~res~0); {43#true} is VALID [2020-07-10 14:42:28,446 INFO L280 TraceCheckUtils]: 20: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:42:28,446 INFO L280 TraceCheckUtils]: 21: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:28,446 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:42:28,447 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {44#false} is VALID [2020-07-10 14:42:28,447 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == #t~ret6;havoc #t~ret6; {44#false} is VALID [2020-07-10 14:42:28,448 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 14:42:28,453 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-10 14:42:28,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516506661] [2020-07-10 14:42:28,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:28,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:28,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847753768] [2020-07-10 14:42:28,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:42:28,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:28,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:28,544 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-10 14:42:28,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:28,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:28,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:28,560 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-10 14:42:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:29,019 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2020-07-10 14:42:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:29,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:42:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:42:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:42:29,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2020-07-10 14:42:29,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:29,216 INFO L225 Difference]: With dead ends: 71 [2020-07-10 14:42:29,216 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 14:42:29,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10 14:42:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 14:42:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 14:42:29,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:29,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:29,313 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:29,313 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:29,328 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:42:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:42:29,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:29,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:29,332 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:29,332 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:29,340 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:42:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:42:29,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:29,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:29,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:29,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 14:42:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-10 14:42:29,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2020-07-10 14:42:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:29,360 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-10 14:42:29,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:42:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:42:29,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:29,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:29,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:29,365 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1283143896, now seen corresponding path program 1 times [2020-07-10 14:42:29,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:29,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544128513] [2020-07-10 14:42:29,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:29,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 14:42:29,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:29,531 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-10 14:42:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:29,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-10 14:42:29,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-10 14:42:29,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:42:29,629 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:29,630 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:29,631 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:29,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-10 14:42:29,633 INFO L263 TraceCheckUtils]: 1: Hoare triple {282#true} call #t~ret2 := __fpclassify_float(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:29,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-10 14:42:29,634 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-10 14:42:29,634 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:42:29,635 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:29,636 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:29,637 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:29,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {310#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {310#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:29,639 INFO L280 TraceCheckUtils]: 9: Hoare triple {310#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {283#false} is VALID [2020-07-10 14:42:29,639 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:42:29,639 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:42:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:29,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:42:29,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:29,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:42:29,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:29,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 14:42:29,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:29,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-10 14:42:29,649 INFO L263 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret7 := main(); {282#true} is VALID [2020-07-10 14:42:29,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {282#true} is VALID [2020-07-10 14:42:29,651 INFO L263 TraceCheckUtils]: 6: Hoare triple {282#true} call #t~ret5 := fmax_float(~x~0, ~y~0); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:29,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-10 14:42:29,654 INFO L263 TraceCheckUtils]: 8: Hoare triple {282#true} call #t~ret2 := __fpclassify_float(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:29,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-10 14:42:29,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-10 14:42:29,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:42:29,656 INFO L280 TraceCheckUtils]: 12: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:29,657 INFO L280 TraceCheckUtils]: 13: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:29,658 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:29,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {310#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {310#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:29,659 INFO L280 TraceCheckUtils]: 16: Hoare triple {310#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {283#false} is VALID [2020-07-10 14:42:29,660 INFO L280 TraceCheckUtils]: 17: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:42:29,660 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:42:29,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#false} ~res~0 := #t~ret5;havoc #t~ret5; {283#false} is VALID [2020-07-10 14:42:29,661 INFO L263 TraceCheckUtils]: 20: Hoare triple {283#false} call #t~ret6 := isnan_float(~res~0); {282#true} is VALID [2020-07-10 14:42:29,661 INFO L280 TraceCheckUtils]: 21: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:42:29,661 INFO L280 TraceCheckUtils]: 22: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:29,662 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:42:29,662 INFO L280 TraceCheckUtils]: 24: Hoare triple {283#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {283#false} is VALID [2020-07-10 14:42:29,662 INFO L280 TraceCheckUtils]: 25: Hoare triple {283#false} assume 0 == #t~ret6;havoc #t~ret6; {283#false} is VALID [2020-07-10 14:42:29,662 INFO L280 TraceCheckUtils]: 26: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-10 14:42:29,664 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-10 14:42:29,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544128513] [2020-07-10 14:42:29,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:29,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:29,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498086374] [2020-07-10 14:42:29,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:42:29,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:29,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:29,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:29,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:29,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:29,702 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 6 states. [2020-07-10 14:42:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:30,335 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-10 14:42:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:30,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:42:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:30,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:42:30,443 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-10 14:42:30,445 INFO L225 Difference]: With dead ends: 51 [2020-07-10 14:42:30,446 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:42:30,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:42:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:42:30,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:30,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:30,493 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:30,493 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:30,497 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:30,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:30,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:30,499 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:30,499 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:30,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:30,503 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:30,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:30,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:30,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:30,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:42:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:42:30,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2020-07-10 14:42:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:30,509 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:42:30,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:42:30,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:30,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:30,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:42:30,512 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:30,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1220464557, now seen corresponding path program 1 times [2020-07-10 14:42:30,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:30,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392640777] [2020-07-10 14:42:30,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:30,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-10 14:42:30,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:30,574 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-10 14:42:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:30,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-10 14:42:30,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-10 14:42:30,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:42:30,696 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-10 14:42:30,696 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-10 14:42:30,697 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-10 14:42:30,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:30,698 INFO L280 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:30,700 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:30,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-10 14:42:30,701 INFO L263 TraceCheckUtils]: 1: Hoare triple {518#true} call #t~ret2 := __fpclassify_float(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:30,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-10 14:42:30,702 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-10 14:42:30,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:42:30,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-10 14:42:30,703 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-10 14:42:30,703 INFO L280 TraceCheckUtils]: 7: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-10 14:42:30,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:30,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:30,706 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:30,707 INFO L280 TraceCheckUtils]: 11: Hoare triple {552#(<= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {552#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:30,708 INFO L280 TraceCheckUtils]: 12: Hoare triple {552#(<= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {519#false} is VALID [2020-07-10 14:42:30,708 INFO L280 TraceCheckUtils]: 13: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:42:30,708 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:42:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:30,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:42:30,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:30,714 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:42:30,715 INFO L263 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:30,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-10 14:42:30,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:30,716 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-10 14:42:30,717 INFO L263 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret7 := main(); {518#true} is VALID [2020-07-10 14:42:30,717 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {518#true} is VALID [2020-07-10 14:42:30,718 INFO L263 TraceCheckUtils]: 6: Hoare triple {518#true} call #t~ret5 := fmax_float(~x~0, ~y~0); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:30,719 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-10 14:42:30,720 INFO L263 TraceCheckUtils]: 8: Hoare triple {518#true} call #t~ret2 := __fpclassify_float(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:30,720 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-10 14:42:30,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-10 14:42:30,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:42:30,721 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-10 14:42:30,721 INFO L280 TraceCheckUtils]: 13: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-10 14:42:30,722 INFO L280 TraceCheckUtils]: 14: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-10 14:42:30,722 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:30,723 INFO L280 TraceCheckUtils]: 16: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:30,724 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:30,725 INFO L280 TraceCheckUtils]: 18: Hoare triple {552#(<= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {552#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:30,726 INFO L280 TraceCheckUtils]: 19: Hoare triple {552#(<= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {519#false} is VALID [2020-07-10 14:42:30,726 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:42:30,726 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:42:30,726 INFO L280 TraceCheckUtils]: 22: Hoare triple {519#false} ~res~0 := #t~ret5;havoc #t~ret5; {519#false} is VALID [2020-07-10 14:42:30,727 INFO L263 TraceCheckUtils]: 23: Hoare triple {519#false} call #t~ret6 := isnan_float(~res~0); {518#true} is VALID [2020-07-10 14:42:30,727 INFO L280 TraceCheckUtils]: 24: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:42:30,727 INFO L280 TraceCheckUtils]: 25: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:30,728 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:42:30,728 INFO L280 TraceCheckUtils]: 27: Hoare triple {519#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {519#false} is VALID [2020-07-10 14:42:30,728 INFO L280 TraceCheckUtils]: 28: Hoare triple {519#false} assume 0 == #t~ret6;havoc #t~ret6; {519#false} is VALID [2020-07-10 14:42:30,728 INFO L280 TraceCheckUtils]: 29: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-10 14:42:30,730 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-10 14:42:30,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392640777] [2020-07-10 14:42:30,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:30,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:30,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37894845] [2020-07-10 14:42:30,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:42:30,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:30,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:30,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:30,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:30,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:30,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:30,764 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:42:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:31,300 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-10 14:42:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:31,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:42:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:31,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:42:31,407 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-10 14:42:31,410 INFO L225 Difference]: With dead ends: 55 [2020-07-10 14:42:31,410 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:42:31,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:42:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-10 14:42:31,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:31,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2020-07-10 14:42:31,451 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2020-07-10 14:42:31,451 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2020-07-10 14:42:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:31,459 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:31,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:31,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:31,463 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2020-07-10 14:42:31,463 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2020-07-10 14:42:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:31,471 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:31,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:31,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:31,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:31,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:42:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:42:31,476 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2020-07-10 14:42:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:31,477 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:42:31,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:42:31,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:31,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:31,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:42:31,479 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 287087252, now seen corresponding path program 1 times [2020-07-10 14:42:31,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:31,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128219074] [2020-07-10 14:42:31,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:31,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:42:31,710 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:42:31,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:42:31,764 WARN L170 areAnnotationChecker]: isnan_floatENTRY has no Hoare annotation [2020-07-10 14:42:31,764 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:42:31,764 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:31,764 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:31,765 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:42:31,765 WARN L170 areAnnotationChecker]: fmax_floatENTRY has no Hoare annotation [2020-07-10 14:42:31,765 WARN L170 areAnnotationChecker]: __fpclassify_floatENTRY has no Hoare annotation [2020-07-10 14:42:31,765 WARN L170 areAnnotationChecker]: isnan_floatFINAL has no Hoare annotation [2020-07-10 14:42:31,765 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:42:31,765 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:31,765 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: isnan_floatEXIT has no Hoare annotation [2020-07-10 14:42:31,766 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:42:31,767 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:42:31,767 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-10 14:42:31,767 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-10 14:42:31,767 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 14:42:31,767 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 14:42:31,767 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 14:42:31,767 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 14:42:31,768 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-10 14:42:31,768 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 14:42:31,768 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-10 14:42:31,768 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-10 14:42:31,768 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-10 14:42:31,768 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2020-07-10 14:42:31,768 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:42:31,769 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:42:31,769 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-10 14:42:31,769 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-10 14:42:31,769 WARN L170 areAnnotationChecker]: fmax_floatFINAL has no Hoare annotation [2020-07-10 14:42:31,769 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 14:42:31,769 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 14:42:31,770 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 14:42:31,770 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 14:42:31,770 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:42:31,770 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:42:31,770 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 14:42:31,770 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 14:42:31,770 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: fmax_floatEXIT has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:31,771 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 14:42:31,772 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 14:42:31,772 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 14:42:31,772 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:42:31,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:42:31 BoogieIcfgContainer [2020-07-10 14:42:31,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:42:31,781 INFO L168 Benchmark]: Toolchain (without parser) took 4709.24 ms. Allocated memory was 145.8 MB in the beginning and 246.9 MB in the end (delta: 101.2 MB). Free memory was 102.0 MB in the beginning and 110.4 MB in the end (delta: -8.4 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:31,782 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 14:42:31,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.93 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 183.1 MB in the end (delta: -81.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:31,790 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:31,791 INFO L168 Benchmark]: RCFGBuilder took 558.13 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 153.3 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:31,797 INFO L168 Benchmark]: TraceAbstraction took 3727.50 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 152.6 MB in the beginning and 110.4 MB in the end (delta: 42.3 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:31,806 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.23 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.93 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 183.1 MB in the end (delta: -81.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.59 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 180.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 558.13 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 153.3 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3727.50 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 152.6 MB in the beginning and 110.4 MB in the end (delta: 42.3 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 65]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L60] float x = 0.0f / 0.0f; [L61] float y = 0.0f / 0.0f; [L62] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095042] [L43] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L20] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L43] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095042, __fpclassify_float(x)=0, x=2139095044, y=2139095042] [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; VAL [\old(x)=2139095044, \old(y)=2139095042, \result=2139095042, x=2139095044, y=2139095042] [L62] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=2139095042, x=2139095044, y=2139095042] [L62] float res = fmax_float(x, y); [L64] CALL, EXPR isnan_float(res) VAL [\old(x)=2139095042] [L54] return x != x; VAL [\old(x)=2139095042, \result=0, x=2139095042] [L64] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2139095042, x=2139095044, y=2139095042] [L64] COND TRUE !isnan_float(res) [L65] __VERIFIER_error() VAL [res=2139095042, x=2139095044, y=2139095042] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 108 SDslu, 43 SDs, 0 SdLazy, 255 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 5222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...