/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/double_req_bl_1232b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:41:01,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:41:01,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:41:01,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:41:01,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:41:01,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:41:01,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:41:01,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:41:01,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:41:01,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:41:01,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:41:01,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:41:01,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:41:01,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:41:01,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:41:01,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:41:01,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:41:01,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:41:01,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:41:01,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:41:01,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:41:01,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:41:01,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:41:01,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:41:01,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:41:01,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:41:01,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:41:01,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:41:01,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:41:01,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:41:01,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:41:01,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:41:01,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:41:01,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:41:01,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:41:01,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:41:01,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:41:01,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:41:01,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:41:01,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:41:01,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:41:01,248 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:41:01,264 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:41:01,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:41:01,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:41:01,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:41:01,266 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:41:01,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:41:01,266 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:41:01,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:41:01,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:41:01,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:41:01,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:41:01,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:41:01,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:41:01,267 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:41:01,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:41:01,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:41:01,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:41:01,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:41:01,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:41:01,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:41:01,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:41:01,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:41:01,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:41:01,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:41:01,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:41:01,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:41:01,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:41:01,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:41:01,270 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:41:01,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:41:01,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:41:01,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:41:01,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:41:01,573 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:41:01,573 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:41:01,574 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b.c [2020-07-10 14:41:01,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff5a62bc/a58ddfb259754497a12b8d991eca8eab/FLAG3a1c27a69 [2020-07-10 14:41:02,142 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:41:02,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232b.c [2020-07-10 14:41:02,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff5a62bc/a58ddfb259754497a12b8d991eca8eab/FLAG3a1c27a69 [2020-07-10 14:41:02,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff5a62bc/a58ddfb259754497a12b8d991eca8eab [2020-07-10 14:41:02,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:41:02,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:41:02,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:02,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:41:02,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:41:02,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:02" (1/1) ... [2020-07-10 14:41:02,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1975b72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:02, skipping insertion in model container [2020-07-10 14:41:02,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:02" (1/1) ... [2020-07-10 14:41:02,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:41:02,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:41:02,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:02,865 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:41:02,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:03,024 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:41:03,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03 WrapperNode [2020-07-10 14:41:03,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:03,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:41:03,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:41:03,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:41:03,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (1/1) ... [2020-07-10 14:41:03,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (1/1) ... [2020-07-10 14:41:03,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (1/1) ... [2020-07-10 14:41:03,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (1/1) ... [2020-07-10 14:41:03,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (1/1) ... [2020-07-10 14:41:03,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (1/1) ... [2020-07-10 14:41:03,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (1/1) ... [2020-07-10 14:41:03,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:41:03,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:41:03,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:41:03,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:41:03,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41: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-10 14:41:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:41:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:41:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 14:41:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 14:41:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-10 14:41:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-10 14:41:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:41:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:41:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 14:41:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 14:41:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 14:41:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:41:03,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:41:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:41:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:41:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-10 14:41:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-10 14:41:03,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:41:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:41:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:41:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:41:03,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:41:03,715 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:41:03,716 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 14:41:03,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:03 BoogieIcfgContainer [2020-07-10 14:41:03,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:41:03,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:41:03,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:41:03,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:41:03,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:41:02" (1/3) ... [2020-07-10 14:41:03,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6059880f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:03, skipping insertion in model container [2020-07-10 14:41:03,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:03" (2/3) ... [2020-07-10 14:41:03,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6059880f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:03, skipping insertion in model container [2020-07-10 14:41:03,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:03" (3/3) ... [2020-07-10 14:41:03,731 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2020-07-10 14:41:03,744 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:41:03,753 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:41:03,769 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:41:03,796 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:41:03,796 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:41:03,797 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:41:03,797 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:41:03,797 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:41:03,797 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:41:03,797 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:41:03,797 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:41:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-10 14:41:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:41:03,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:03,825 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-10 14:41:03,825 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1786760399, now seen corresponding path program 1 times [2020-07-10 14:41:03,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:03,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706588513] [2020-07-10 14:41:03,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:04,085 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-10 14:41:04,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:41:04,086 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #96#return; {47#true} is VALID [2020-07-10 14:41:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:04,195 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 ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:04,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:04,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:04,197 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:04,198 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #100#return; {48#false} is VALID [2020-07-10 14:41:04,200 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-10 14:41:04,203 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:04,203 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 ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:04,204 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:04,205 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:04,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:04,206 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #100#return; {48#false} is VALID [2020-07-10 14:41:04,207 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-10 14:41:04,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-10 14:41:04,208 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:04,209 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #92#return; {48#false} is VALID [2020-07-10 14:41:04,217 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-10 14:41:04,217 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-10 14:41:04,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:41:04,218 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #96#return; {47#true} is VALID [2020-07-10 14:41:04,219 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret12 := main(); {47#true} is VALID [2020-07-10 14:41:04,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0);~y~0 := 0.0; {47#true} is VALID [2020-07-10 14:41:04,221 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret9 := fmin_double(~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-10 14:41:04,222 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-10 14:41:04,224 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:04,225 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 ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:04,226 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:04,227 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:04,227 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:04,228 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #100#return; {48#false} is VALID [2020-07-10 14:41:04,228 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-10 14:41:04,229 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-10 14:41:04,229 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:04,229 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #92#return; {48#false} is VALID [2020-07-10 14:41:04,230 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); {48#false} is VALID [2020-07-10 14:41:04,233 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short11; {48#false} is VALID [2020-07-10 14:41:04,233 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {48#false} is VALID [2020-07-10 14:41:04,234 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-10 14:41:04,242 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:41:04,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706588513] [2020-07-10 14:41:04,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:04,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:41:04,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295248849] [2020-07-10 14:41:04,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:41:04,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:04,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:41:04,320 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-10 14:41:04,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:41:04,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:41:04,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:41:04,337 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-10 14:41:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:04,806 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-10 14:41:04,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:41:04,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:41:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:41:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:41:04,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-10 14:41:04,997 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-10 14:41:05,012 INFO L225 Difference]: With dead ends: 79 [2020-07-10 14:41:05,013 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:41:05,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:41:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:41:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:41:05,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:05,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:05,094 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:05,095 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:05,101 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:05,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:05,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:05,103 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:05,103 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:05,109 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:05,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:05,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:05,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:05,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:41:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:41:05,117 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-10 14:41:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:05,118 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:41:05,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:41:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:41:05,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:05,120 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-10 14:41:05,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:41:05,121 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash -952976765, now seen corresponding path program 1 times [2020-07-10 14:41:05,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:05,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790047331] [2020-07-10 14:41:05,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:05,233 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-10 14:41:05,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:41:05,234 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #96#return; {306#true} is VALID [2020-07-10 14:41:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:05,374 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 ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:05,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:05,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:05,377 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:05,377 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:05,378 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #100#return; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:05,379 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-10 14:41:05,381 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:05,382 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 ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:05,382 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:05,382 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:05,384 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:05,386 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:05,389 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #100#return; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:05,391 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:05,392 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-10 14:41:05,393 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:41:05,393 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #92#return; {307#false} is VALID [2020-07-10 14:41:05,394 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-10 14:41:05,395 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-10 14:41:05,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:41:05,395 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #96#return; {306#true} is VALID [2020-07-10 14:41:05,396 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret12 := main(); {306#true} is VALID [2020-07-10 14:41:05,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0);~y~0 := 0.0; {306#true} is VALID [2020-07-10 14:41:05,398 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret9 := fmin_double(~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-10 14:41:05,398 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-10 14:41:05,399 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:05,400 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 ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:05,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:05,400 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:05,401 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:05,402 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:05,403 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #100#return; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:05,404 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:05,405 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-10 14:41:05,405 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:41:05,406 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #92#return; {307#false} is VALID [2020-07-10 14:41:05,406 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); {307#false} is VALID [2020-07-10 14:41:05,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short11; {307#false} is VALID [2020-07-10 14:41:05,406 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {307#false} is VALID [2020-07-10 14:41:05,407 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-10 14:41:05,408 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:41:05,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790047331] [2020-07-10 14:41:05,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:05,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:05,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062412800] [2020-07-10 14:41:05,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:41:05,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:05,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:05,448 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-10 14:41:05,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:05,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:05,450 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:41:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:06,145 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-10 14:41:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:06,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:41:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:06,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:41:06,270 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-10 14:41:06,273 INFO L225 Difference]: With dead ends: 59 [2020-07-10 14:41:06,274 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:41:06,275 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-10 14:41:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:41:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:41:06,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:06,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:06,304 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:06,304 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:06,309 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:06,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:06,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:06,310 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:06,311 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:06,315 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:06,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:06,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:06,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:06,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:41:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:41:06,321 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-10 14:41:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:06,321 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:41:06,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:41:06,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:06,323 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:41:06,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:41:06,324 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1944362408, now seen corresponding path program 1 times [2020-07-10 14:41:06,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:06,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11890170] [2020-07-10 14:41:06,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:06,424 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-10 14:41:06,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:41:06,425 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #96#return; {562#true} is VALID [2020-07-10 14:41:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:06,525 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 ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:06,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:06,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:06,526 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:06,526 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:06,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:06,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:06,528 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:06,530 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #100#return; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:06,530 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-10 14:41:06,531 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:06,531 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 ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:06,532 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:06,532 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:06,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:06,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:06,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:06,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:06,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:06,535 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #100#return; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:06,536 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:06,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-10 14:41:06,537 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:41:06,537 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #92#return; {563#false} is VALID [2020-07-10 14:41:06,539 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-10 14:41:06,539 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-10 14:41:06,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:41:06,540 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #96#return; {562#true} is VALID [2020-07-10 14:41:06,540 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret12 := main(); {562#true} is VALID [2020-07-10 14:41:06,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := ~someUnaryDOUBLEoperation(0.0);~y~0 := 0.0; {562#true} is VALID [2020-07-10 14:41:06,541 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret9 := fmin_double(~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-10 14:41:06,542 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-10 14:41:06,543 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:06,543 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 ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:06,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:06,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:06,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:06,544 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:06,545 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:06,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:06,546 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:06,547 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #100#return; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:06,548 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:06,549 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-10 14:41:06,549 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:41:06,549 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #92#return; {563#false} is VALID [2020-07-10 14:41:06,550 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); {563#false} is VALID [2020-07-10 14:41:06,550 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short11; {563#false} is VALID [2020-07-10 14:41:06,550 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {563#false} is VALID [2020-07-10 14:41:06,550 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-10 14:41:06,552 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:41:06,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11890170] [2020-07-10 14:41:06,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:06,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:06,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200602673] [2020-07-10 14:41:06,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:41:06,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:06,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:06,581 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:41:06,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:06,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:06,582 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-10 14:41:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:07,163 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-10 14:41:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:07,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:41:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:07,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:41:07,303 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-10 14:41:07,306 INFO L225 Difference]: With dead ends: 63 [2020-07-10 14:41:07,306 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 14:41:07,307 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-10 14:41:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 14:41:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-10 14:41:07,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:07,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:07,338 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:07,338 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:07,342 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:41:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:41:07,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:07,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:07,343 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-10 14:41:07,343 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-10 14:41:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:07,347 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:41:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:41:07,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:07,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:07,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:07,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:41:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:41:07,352 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-10 14:41:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:07,352 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:41:07,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:41:07,353 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:07,354 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:41:07,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:41:07,354 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash 553653529, now seen corresponding path program 1 times [2020-07-10 14:41:07,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:07,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98773337] [2020-07-10 14:41:07,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:07,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:41:07,527 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:41:07,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:41:07,563 WARN L170 areAnnotationChecker]: isnan_doubleENTRY has no Hoare annotation [2020-07-10 14:41:07,563 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:41:07,563 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-10 14:41:07,564 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:41:07,564 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:41:07,564 WARN L170 areAnnotationChecker]: __signbit_doubleENTRY has no Hoare annotation [2020-07-10 14:41:07,564 WARN L170 areAnnotationChecker]: fmin_doubleENTRY has no Hoare annotation [2020-07-10 14:41:07,564 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:41:07,564 WARN L170 areAnnotationChecker]: isnan_doubleFINAL has no Hoare annotation [2020-07-10 14:41:07,564 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 14:41:07,565 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-10 14:41:07,566 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:41:07,567 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 14:41:07,567 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-10 14:41:07,567 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-10 14:41:07,567 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 14:41:07,567 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 14:41:07,567 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-10 14:41:07,567 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: __signbit_doubleFINAL has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 14:41:07,568 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:41:07,569 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:41:07,569 WARN L170 areAnnotationChecker]: __signbit_doubleEXIT has no Hoare annotation [2020-07-10 14:41:07,569 WARN L170 areAnnotationChecker]: fmin_doubleFINAL has no Hoare annotation [2020-07-10 14:41:07,569 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-10 14:41:07,569 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-10 14:41:07,569 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2020-07-10 14:41:07,569 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: fmin_doubleEXIT has no Hoare annotation [2020-07-10 14:41:07,570 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 14:41:07,571 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-10 14:41:07,572 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:41:07,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:41:07 BoogieIcfgContainer [2020-07-10 14:41:07,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:41:07,578 INFO L168 Benchmark]: Toolchain (without parser) took 5022.32 ms. Allocated memory was 144.7 MB in the beginning and 285.2 MB in the end (delta: 140.5 MB). Free memory was 102.2 MB in the beginning and 250.2 MB in the end (delta: -148.0 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:07,579 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:41:07,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.33 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 101.8 MB in the beginning and 179.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:07,581 INFO L168 Benchmark]: Boogie Preprocessor took 60.18 ms. Allocated memory is still 201.3 MB. Free memory was 179.7 MB in the beginning and 176.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:07,582 INFO L168 Benchmark]: RCFGBuilder took 635.12 ms. Allocated memory is still 201.3 MB. Free memory was 176.9 MB in the beginning and 144.6 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:07,583 INFO L168 Benchmark]: TraceAbstraction took 3851.90 ms. Allocated memory was 201.3 MB in the beginning and 285.2 MB in the end (delta: 83.9 MB). Free memory was 144.6 MB in the beginning and 250.2 MB in the end (delta: -105.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:07,586 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.24 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 468.33 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 101.8 MB in the beginning and 179.7 MB in the end (delta: -77.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.18 ms. Allocated memory is still 201.3 MB. Free memory was 179.7 MB in the beginning and 176.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 635.12 ms. Allocated memory is still 201.3 MB. Free memory was 176.9 MB in the beginning and 144.6 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3851.90 ms. Allocated memory was 201.3 MB in the beginning and 285.2 MB in the end (delta: 83.9 MB). Free memory was 144.6 MB in the beginning and 250.2 MB in the end (delta: -105.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 74. Possible FailurePath: [L74] double x = -0.0; [L75] double y = 0.0; VAL [y=0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=2147483652, \old(y)=0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=2147483652] [L19] __uint32_t msw, lsw; VAL [\old(x)=2147483652, x=2147483652] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=2147483652, lsw=1, msw=2147483647, x=2147483652] [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=2147483652, lsw=1, msw=2147483647, x=2147483652] [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=2147483652, lsw=1, msw=2147483647, x=2147483652] [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; VAL [\old(x)=2147483652, \result=0, lsw=1, msw=2147483647, x=2147483652] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=2147483652, \old(y)=0, __fpclassify_double(x)=0, x=2147483652, y=0] [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; VAL [\old(x)=2147483652, \old(y)=0, \result=0, x=2147483652, y=0] [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0, x=2147483652, y=0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0, res == -0.0 && __signbit_double(res) == 1=0, x=2147483652, y=0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0, x=2147483652, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.2s, 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.2s 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.1s SatisfiabilityAnalysisTime, 0.7s 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...