/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_1252a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:06:02,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:06:02,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:06:02,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:06:02,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:06:02,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:06:02,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:06:02,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:06:02,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:06:02,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:06:02,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:06:02,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:06:02,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:06:02,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:06:02,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:06:02,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:06:02,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:06:02,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:06:02,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:06:02,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:06:02,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:06:02,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:06:02,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:06:02,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:06:02,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:06:02,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:06:02,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:06:02,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:06:02,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:06:02,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:06:02,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:06:02,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:06:02,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:06:02,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:06:02,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:06:02,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:06:02,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:06:02,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:06:02,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:06:02,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:06:02,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:06:02,180 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-17 22:06:02,202 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:06:02,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:06:02,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:06:02,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:06:02,205 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:06:02,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:06:02,206 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:06:02,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:06:02,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:06:02,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:06:02,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:06:02,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:06:02,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:06:02,208 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:06:02,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:06:02,209 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:06:02,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:06:02,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:06:02,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:06:02,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:06:02,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:06:02,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:06:02,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:06:02,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:06:02,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:06:02,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:06:02,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:06:02,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:06:02,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:06:02,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:06:02,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:06:02,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:06:02,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:06:02,565 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:06:02,565 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:06:02,566 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1252a.c [2020-07-17 22:06:02,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a53ebc9/6a7b4b6bcf77407ab2539916bf22b397/FLAGfeb20aa18 [2020-07-17 22:06:03,063 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:06:03,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1252a.c [2020-07-17 22:06:03,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a53ebc9/6a7b4b6bcf77407ab2539916bf22b397/FLAGfeb20aa18 [2020-07-17 22:06:03,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a53ebc9/6a7b4b6bcf77407ab2539916bf22b397 [2020-07-17 22:06:03,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:06:03,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:06:03,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:03,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:06:03,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:06:03,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba7554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03, skipping insertion in model container [2020-07-17 22:06:03,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:06:03,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:06:03,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:03,705 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:06:03,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:03,848 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:06:03,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03 WrapperNode [2020-07-17 22:06:03,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:03,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:06:03,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:06:03,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:06:03,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (1/1) ... [2020-07-17 22:06:03,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:06:03,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:06:03,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:06:03,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:06:03,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (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-17 22:06:03,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:06:03,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:06:03,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-17 22:06:03,991 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-17 22:06:03,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-17 22:06:03,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:06:03,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:06:03,991 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-17 22:06:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:06:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-17 22:06:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:06:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:06:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-17 22:06:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-17 22:06:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:06:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:06:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:06:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:06:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-17 22:06:04,524 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:06:04,524 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:06:04,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:04 BoogieIcfgContainer [2020-07-17 22:06:04,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:06:04,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:06:04,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:06:04,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:06:04,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:06:03" (1/3) ... [2020-07-17 22:06:04,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499cd186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:04, skipping insertion in model container [2020-07-17 22:06:04,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:03" (2/3) ... [2020-07-17 22:06:04,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499cd186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:04, skipping insertion in model container [2020-07-17 22:06:04,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:04" (3/3) ... [2020-07-17 22:06:04,538 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252a.c [2020-07-17 22:06:04,549 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:06:04,558 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:06:04,573 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:06:04,600 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:06:04,601 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:06:04,601 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:06:04,601 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:06:04,601 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:06:04,602 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:06:04,602 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:06:04,602 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:06:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-17 22:06:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:06:04,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:04,634 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] [2020-07-17 22:06:04,635 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1078913502, now seen corresponding path program 1 times [2020-07-17 22:06:04,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:04,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744904149] [2020-07-17 22:06:04,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:04,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(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; {47#true} is VALID [2020-07-17 22:06:04,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-17 22:06:04,920 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-17 22:06:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:05,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-17 22:06:05,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-17 22:06:05,047 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-17 22:06:05,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:06:05,049 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-17 22:06:05,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-17 22:06:05,054 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:05,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-17 22:06:05,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-17 22:06:05,056 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-17 22:06:05,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:06:05,057 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-17 22:06:05,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-17 22:06:05,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-17 22:06:05,059 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:06:05,060 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-17 22:06:05,063 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:06:05,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {63#(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; {47#true} is VALID [2020-07-17 22:06:05,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-17 22:06:05,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-17 22:06:05,066 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret10 := main(); {47#true} is VALID [2020-07-17 22:06:05,066 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := ~someUnaryFLOAToperation(0.0);~y~0 := 0.0; {47#true} is VALID [2020-07-17 22:06:05,068 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret7 := fmax_float(~x~0, ~y~0); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:05,069 INFO L280 TraceCheckUtils]: 7: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-17 22:06:05,071 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:05,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-17 22:06:05,073 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-17 22:06:05,074 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-17 22:06:05,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:06:05,075 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-17 22:06:05,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-17 22:06:05,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-17 22:06:05,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:06:05,079 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-17 22:06:05,079 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {48#false} is VALID [2020-07-17 22:06:05,080 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short9; {48#false} is VALID [2020-07-17 22:06:05,080 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {48#false} is VALID [2020-07-17 22:06:05,081 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-17 22:06:05,086 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-17 22:06:05,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744904149] [2020-07-17 22:06:05,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:05,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:06:05,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885983145] [2020-07-17 22:06:05,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:06:05,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:05,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:06:05,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:05,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:06:05,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:06:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:06:05,195 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-17 22:06:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:05,713 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-17 22:06:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:06:05,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:06:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:06:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-17 22:06:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:06:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-17 22:06:05,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-17 22:06:05,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:05,911 INFO L225 Difference]: With dead ends: 79 [2020-07-17 22:06:05,911 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:06:05,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:06:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:06:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 22:06:05,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:05,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:05,984 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:05,984 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:05,991 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-17 22:06:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:06:05,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:05,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:05,993 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:05,993 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:06:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:05,999 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-17 22:06:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:06:06,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:06,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:06,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:06,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:06:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-17 22:06:06,006 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-17 22:06:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:06,007 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-17 22:06:06,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:06:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:06:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:06:06,009 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:06,009 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] [2020-07-17 22:06:06,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:06:06,010 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:06,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:06,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1357269066, now seen corresponding path program 1 times [2020-07-17 22:06:06,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:06,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711963169] [2020-07-17 22:06:06,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:06,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#(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; {306#true} is VALID [2020-07-17 22:06:06,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-17 22:06:06,094 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-17 22:06:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:06,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-17 22:06:06,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#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; {306#true} is VALID [2020-07-17 22:06:06,183 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-17 22:06:06,184 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:06,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:06,186 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:06,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-17 22:06:06,188 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:06,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-17 22:06:06,188 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#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; {306#true} is VALID [2020-07-17 22:06:06,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-17 22:06:06,190 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:06,191 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:06,193 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:06,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:06,195 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-17 22:06:06,195 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-17 22:06:06,196 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-17 22:06:06,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:06:06,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(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; {306#true} is VALID [2020-07-17 22:06:06,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-17 22:06:06,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-17 22:06:06,199 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret10 := main(); {306#true} is VALID [2020-07-17 22:06:06,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := ~someUnaryFLOAToperation(0.0);~y~0 := 0.0; {306#true} is VALID [2020-07-17 22:06:06,201 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret7 := fmax_float(~x~0, ~y~0); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:06,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-17 22:06:06,203 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:06,204 INFO L280 TraceCheckUtils]: 9: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-17 22:06:06,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#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; {306#true} is VALID [2020-07-17 22:06:06,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-17 22:06:06,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:06,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:06,208 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:06,208 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:06,209 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-17 22:06:06,209 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-17 22:06:06,210 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-17 22:06:06,210 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {307#false} is VALID [2020-07-17 22:06:06,210 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short9; {307#false} is VALID [2020-07-17 22:06:06,211 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {307#false} is VALID [2020-07-17 22:06:06,211 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-17 22:06:06,213 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-17 22:06:06,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711963169] [2020-07-17 22:06:06,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:06,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:06:06,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123768194] [2020-07-17 22:06:06,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:06:06,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:06,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:06:06,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:06,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:06:06,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:06:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:06:06,254 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-17 22:06:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:06,899 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-17 22:06:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:06:06,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:06:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:06:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:06:06,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-17 22:06:07,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:07,015 INFO L225 Difference]: With dead ends: 59 [2020-07-17 22:06:07,015 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:06:07,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-17 22:06:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:06:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-17 22:06:07,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:07,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-17 22:06:07,050 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:06:07,051 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:06:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:07,055 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:06:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:06:07,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:07,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:07,057 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:06:07,057 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:06:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:07,061 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:06:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:06:07,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:07,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:07,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:07,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:06:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-17 22:06:07,067 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-17 22:06:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:07,068 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-17 22:06:07,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:06:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:06:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:06:07,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:07,069 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-17 22:06:07,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:06:07,070 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash 888409989, now seen corresponding path program 1 times [2020-07-17 22:06:07,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:07,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687188886] [2020-07-17 22:06:07,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:07,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {582#(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; {562#true} is VALID [2020-07-17 22:06:07,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-17 22:06:07,144 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-17 22:06:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:07,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-17 22:06:07,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#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; {562#true} is VALID [2020-07-17 22:06:07,240 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-17 22:06:07,240 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-17 22:06:07,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-17 22:06:07,241 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-17 22:06:07,242 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:07,242 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:07,244 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:07,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-17 22:06:07,249 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:07,250 INFO L280 TraceCheckUtils]: 2: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-17 22:06:07,250 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#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; {562#true} is VALID [2020-07-17 22:06:07,250 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-17 22:06:07,251 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-17 22:06:07,251 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-17 22:06:07,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-17 22:06:07,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:07,255 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:07,257 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:07,257 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:07,258 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-17 22:06:07,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-17 22:06:07,259 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-17 22:06:07,261 INFO L263 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:06:07,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#(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; {562#true} is VALID [2020-07-17 22:06:07,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-17 22:06:07,262 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-17 22:06:07,262 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret10 := main(); {562#true} is VALID [2020-07-17 22:06:07,262 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := ~someUnaryFLOAToperation(0.0);~y~0 := 0.0; {562#true} is VALID [2020-07-17 22:06:07,264 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret7 := fmax_float(~x~0, ~y~0); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:07,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-17 22:06:07,266 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:06:07,266 INFO L280 TraceCheckUtils]: 9: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-17 22:06:07,267 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#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; {562#true} is VALID [2020-07-17 22:06:07,267 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-17 22:06:07,267 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-17 22:06:07,267 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-17 22:06:07,268 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-17 22:06:07,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:07,289 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-17 22:06:07,290 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:07,291 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-17 22:06:07,291 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-17 22:06:07,292 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-17 22:06:07,292 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-17 22:06:07,292 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {563#false} is VALID [2020-07-17 22:06:07,292 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short9; {563#false} is VALID [2020-07-17 22:06:07,292 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {563#false} is VALID [2020-07-17 22:06:07,293 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-17 22:06:07,298 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-17 22:06:07,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687188886] [2020-07-17 22:06:07,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:07,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:06:07,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871440668] [2020-07-17 22:06:07,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-17 22:06:07,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:07,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:06:07,351 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-17 22:06:07,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:06:07,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:06:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:06:07,353 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-17 22:06:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:07,916 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-17 22:06:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:06:07,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-17 22:06:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:06:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:06:07,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-17 22:06:08,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:06:08,031 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:06:08,032 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:06:08,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-17 22:06:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:06:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-17 22:06:08,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:08,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-17 22:06:08,071 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-17 22:06:08,072 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-17 22:06:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:08,077 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:06:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:06:08,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:08,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:08,078 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-17 22:06:08,079 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-17 22:06:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:08,087 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:06:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:06:08,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:08,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:08,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:08,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:06:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-17 22:06:08,092 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-17 22:06:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:08,092 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-17 22:06:08,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:06:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:06:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:06:08,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:08,094 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-17 22:06:08,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:06:08,094 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash -908541370, now seen corresponding path program 1 times [2020-07-17 22:06:08,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:08,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151529635] [2020-07-17 22:06:08,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:06:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:06:08,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:06:08,333 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:06:08,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:06:08,363 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: fmax_floatENTRY has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: __fpclassify_floatENTRY has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: __signbit_floatENTRY has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:06:08,364 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-17 22:06:08,365 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-17 22:06:08,366 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-17 22:06:08,367 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: __signbit_floatFINAL has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: L78-4 has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: L78-4 has no Hoare annotation [2020-07-17 22:06:08,368 WARN L170 areAnnotationChecker]: fmax_floatFINAL has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: __signbit_floatEXIT has no Hoare annotation [2020-07-17 22:06:08,369 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: fmax_floatEXIT has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:06:08,370 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:06:08,371 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-17 22:06:08,371 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-17 22:06:08,371 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:06:08,371 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:06:08,371 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-17 22:06:08,371 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-17 22:06:08,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:06:08 BoogieIcfgContainer [2020-07-17 22:06:08,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:06:08,377 INFO L168 Benchmark]: Toolchain (without parser) took 4907.37 ms. Allocated memory was 138.4 MB in the beginning and 279.4 MB in the end (delta: 141.0 MB). Free memory was 102.7 MB in the beginning and 233.9 MB in the end (delta: -131.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:08,378 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:06:08,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.59 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 181.7 MB in the end (delta: -79.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:08,380 INFO L168 Benchmark]: Boogie Preprocessor took 73.87 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 178.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:08,381 INFO L168 Benchmark]: RCFGBuilder took 604.11 ms. Allocated memory is still 202.9 MB. Free memory was 178.4 MB in the beginning and 148.3 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:06:08,381 INFO L168 Benchmark]: TraceAbstraction took 3843.81 ms. Allocated memory was 202.9 MB in the beginning and 279.4 MB in the end (delta: 76.5 MB). Free memory was 148.3 MB in the beginning and 233.9 MB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:06:08,385 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.49 ms. Allocated memory is still 138.4 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.59 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 181.7 MB in the end (delta: -79.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.87 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 178.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 604.11 ms. Allocated memory is still 202.9 MB. Free memory was 178.4 MB in the beginning and 148.3 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3843.81 ms. Allocated memory was 202.9 MB in the beginning and 279.4 MB in the end (delta: 76.5 MB). Free memory was 148.3 MB in the beginning and 233.9 MB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 79]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someUnaryFLOAToperation at line 72. Possible FailurePath: [L72] float x = -0.0f; [L73] float y = 0.0f; VAL [y=0] [L75] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2147483649, \old(y)=0] [L43] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2147483649] [L20] __uint32_t w; VAL [\old(x)=2147483649, x=2147483649] [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)=2147483649, w=2147483647, x=2147483649] [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; VAL [\old(x)=2147483649, \result=0, w=2147483647, x=2147483649] [L43] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2147483649, \old(y)=0, __fpclassify_float(x)=0, x=2147483649, y=0] [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; VAL [\old(x)=2147483649, \old(y)=0, \result=0, x=2147483649, y=0] [L75] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=0, x=2147483649, y=0] [L75] float res = fmax_float(x, y); [L78] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0, res == 0.0f && __signbit_float(res) == 0=0, x=2147483649, y=0] [L78] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L79] __VERIFIER_error() VAL [res=0, x=2147483649, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 123 SDtfs, 117 SDslu, 43 SDs, 0 SdLazy, 296 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 4170 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...