/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_1230.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:40:50,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:40:50,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:40:50,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:40:50,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:40:50,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:40:50,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:40:50,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:40:50,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:40:50,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:40:50,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:40:50,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:40:50,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:40:50,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:40:50,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:40:50,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:40:50,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:40:50,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:40:50,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:40:50,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:40:50,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:40:50,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:40:50,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:40:50,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:40:50,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:40:50,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:40:50,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:40:50,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:40:50,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:40:50,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:40:50,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:40:50,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:40:50,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:40:50,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:40:50,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:40:50,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:40:50,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:40:50,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:40:50,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:40:50,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:40:50,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:40:50,170 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:40:50,184 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:40:50,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:40:50,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:40:50,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:40:50,186 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:40:50,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:40:50,187 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:40:50,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:40:50,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:40:50,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:40:50,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:40:50,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:40:50,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:40:50,188 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:40:50,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:40:50,189 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:40:50,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:40:50,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:40:50,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:40:50,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:40:50,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:40:50,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:40:50,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:40:50,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:40:50,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:40:50,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:40:50,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:40:50,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:40:50,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:40:50,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:40:50,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:40:50,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:40:50,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:40:50,497 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:40:50,497 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:40:50,498 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-07-10 14:40:50,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00254c62/2c85a8b62d54457c85fa33e562b0d7e8/FLAGdbe36bb4a [2020-07-10 14:40:51,019 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:40:51,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-07-10 14:40:51,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00254c62/2c85a8b62d54457c85fa33e562b0d7e8/FLAGdbe36bb4a [2020-07-10 14:40:51,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00254c62/2c85a8b62d54457c85fa33e562b0d7e8 [2020-07-10 14:40:51,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:40:51,435 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:40:51,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:40:51,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:40:51,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:40:51,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adb9ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51, skipping insertion in model container [2020-07-10 14:40:51,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:40:51,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:40:51,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:40:51,673 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:40:51,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:40:51,804 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:40:51,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51 WrapperNode [2020-07-10 14:40:51,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:40:51,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:40:51,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:40:51,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:40:51,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (1/1) ... [2020-07-10 14:40:51,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:40:51,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:40:51,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:40:51,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:40:51,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (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:40:51,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:40:51,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:40:51,920 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 14:40:51,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 14:40:51,920 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-10 14:40:51,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:40:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:40:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 14:40:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 14:40:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 14:40:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:40:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:40:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:40:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:40:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-10 14:40:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:40:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:40:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:40:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:40:51,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:40:52,366 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:40:52,367 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 14:40:52,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:40:52 BoogieIcfgContainer [2020-07-10 14:40:52,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:40:52,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:40:52,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:40:52,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:40:52,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:40:51" (1/3) ... [2020-07-10 14:40:52,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599117c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:40:52, skipping insertion in model container [2020-07-10 14:40:52,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:40:51" (2/3) ... [2020-07-10 14:40:52,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599117c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:40:52, skipping insertion in model container [2020-07-10 14:40:52,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:40:52" (3/3) ... [2020-07-10 14:40:52,378 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2020-07-10 14:40:52,388 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:40:52,396 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:40:52,411 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:40:52,433 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:40:52,434 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:40:52,434 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:40:52,434 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:40:52,434 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:40:52,434 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:40:52,434 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:40:52,435 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:40:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 14:40:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:40:52,458 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:40:52,459 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:40:52,460 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:40:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:40:52,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1251720270, now seen corresponding path program 1 times [2020-07-10 14:40:52,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:40:52,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805771489] [2020-07-10 14:40:52,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:40:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:52,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 14:40:52,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:40:52,750 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #75#return; {43#true} is VALID [2020-07-10 14:40:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:52,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {43#true} is VALID [2020-07-10 14:40:52,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:40:52,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {44#false} is VALID [2020-07-10 14:40:52,815 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:40:52,816 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2020-07-10 14:40:52,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-10 14:40:52,819 INFO L263 TraceCheckUtils]: 1: Hoare triple {43#true} call #t~ret4 := __fpclassify_double(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:52,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {43#true} is VALID [2020-07-10 14:40:52,821 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:40:52,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {44#false} is VALID [2020-07-10 14:40:52,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:40:52,822 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2020-07-10 14:40:52,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {44#false} is VALID [2020-07-10 14:40:52,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {44#false} is VALID [2020-07-10 14:40:52,824 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:40:52,824 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:40:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:52,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:40:52,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:40:52,838 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:40:52,840 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:40:52,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 14:40:52,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:40:52,841 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #75#return; {43#true} is VALID [2020-07-10 14:40:52,841 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2020-07-10 14:40:52,842 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {43#true} is VALID [2020-07-10 14:40:52,844 INFO L263 TraceCheckUtils]: 6: Hoare triple {43#true} call #t~ret7 := fmin_double(~x~0, ~y~0); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:52,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-10 14:40:52,847 INFO L263 TraceCheckUtils]: 8: Hoare triple {43#true} call #t~ret4 := __fpclassify_double(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:52,847 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {43#true} is VALID [2020-07-10 14:40:52,848 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:40:52,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {44#false} is VALID [2020-07-10 14:40:52,849 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:40:52,850 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2020-07-10 14:40:52,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {44#false} is VALID [2020-07-10 14:40:52,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {44#false} is VALID [2020-07-10 14:40:52,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:40:52,851 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:40:52,851 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~res~0 := #t~ret7;havoc #t~ret7; {44#false} is VALID [2020-07-10 14:40:52,852 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call #t~ret8 := isnan_double(~res~0); {43#true} is VALID [2020-07-10 14:40:52,852 INFO L280 TraceCheckUtils]: 20: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:40:52,853 INFO L280 TraceCheckUtils]: 21: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:40:52,853 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:40:52,853 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {44#false} is VALID [2020-07-10 14:40:52,854 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == #t~ret8;havoc #t~ret8; {44#false} is VALID [2020-07-10 14:40:52,854 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 14:40:52,859 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:40:52,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805771489] [2020-07-10 14:40:52,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:40:52,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:40:52,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207539776] [2020-07-10 14:40:52,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:40:52,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:40:52,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:40:52,966 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:40:52,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:40:52,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:40:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:40:52,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:40:52,980 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-10 14:40:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:53,443 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2020-07-10 14:40:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:40:53,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:40:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:40:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:40:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:40:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:40:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:40:53,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2020-07-10 14:40:53,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:53,615 INFO L225 Difference]: With dead ends: 71 [2020-07-10 14:40:53,616 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 14:40:53,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10 14:40:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 14:40:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 14:40:53,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:40:53,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 14:40:53,680 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:40:53,681 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:40:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:53,687 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:40:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:40:53,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:53,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:53,689 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:40:53,689 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:40:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:53,694 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:40:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:40:53,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:53,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:53,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:40:53,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:40:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 14:40:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-10 14:40:53,702 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2020-07-10 14:40:53,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:40:53,702 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-10 14:40:53,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:40:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:40:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:40:53,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:40:53,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:40:53,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:40:53,705 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:40:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:40:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1491407075, now seen corresponding path program 1 times [2020-07-10 14:40:53,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:40:53,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403289936] [2020-07-10 14:40:53,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:40:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:53,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 14:40:53,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:40:53,803 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #75#return; {282#true} is VALID [2020-07-10 14:40:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:53,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {282#true} is VALID [2020-07-10 14:40:53,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#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~union1;havoc #t~mem0;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; {282#true} is VALID [2020-07-10 14:40:53,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:40:53,929 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:53,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#(<= 2 |__fpclassify_double_#res|)} assume true; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:53,931 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {311#(<= 2 |__fpclassify_double_#res|)} {282#true} #79#return; {310#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:53,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-10 14:40:53,933 INFO L263 TraceCheckUtils]: 1: Hoare triple {282#true} call #t~ret4 := __fpclassify_double(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:53,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {282#true} is VALID [2020-07-10 14:40:53,934 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#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~union1;havoc #t~mem0;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; {282#true} is VALID [2020-07-10 14:40:53,934 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:40:53,936 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:53,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#(<= 2 |__fpclassify_double_#res|)} assume true; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:53,938 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {311#(<= 2 |__fpclassify_double_#res|)} {282#true} #79#return; {310#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:53,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {310#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {310#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:53,940 INFO L280 TraceCheckUtils]: 9: Hoare triple {310#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {283#false} is VALID [2020-07-10 14:40:53,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:40:53,941 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:40:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:53,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:40:53,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:40:53,950 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:40:53,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:40:53,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 14:40:53,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:40:53,952 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #75#return; {282#true} is VALID [2020-07-10 14:40:53,953 INFO L263 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret9 := main(); {282#true} is VALID [2020-07-10 14:40:53,953 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {282#true} is VALID [2020-07-10 14:40:53,955 INFO L263 TraceCheckUtils]: 6: Hoare triple {282#true} call #t~ret7 := fmin_double(~x~0, ~y~0); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:53,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-10 14:40:53,957 INFO L263 TraceCheckUtils]: 8: Hoare triple {282#true} call #t~ret4 := __fpclassify_double(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:53,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {282#true} is VALID [2020-07-10 14:40:53,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {282#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~union1;havoc #t~mem0;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; {282#true} is VALID [2020-07-10 14:40:53,959 INFO L280 TraceCheckUtils]: 11: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:40:53,960 INFO L280 TraceCheckUtils]: 12: Hoare triple {282#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:53,961 INFO L280 TraceCheckUtils]: 13: Hoare triple {311#(<= 2 |__fpclassify_double_#res|)} assume true; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:53,962 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {311#(<= 2 |__fpclassify_double_#res|)} {282#true} #79#return; {310#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:53,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {310#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {310#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:53,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {310#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {283#false} is VALID [2020-07-10 14:40:53,964 INFO L280 TraceCheckUtils]: 17: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:40:53,965 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:40:53,965 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#false} ~res~0 := #t~ret7;havoc #t~ret7; {283#false} is VALID [2020-07-10 14:40:53,965 INFO L263 TraceCheckUtils]: 20: Hoare triple {283#false} call #t~ret8 := isnan_double(~res~0); {282#true} is VALID [2020-07-10 14:40:53,966 INFO L280 TraceCheckUtils]: 21: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:40:53,966 INFO L280 TraceCheckUtils]: 22: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:40:53,966 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:40:53,966 INFO L280 TraceCheckUtils]: 24: Hoare triple {283#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {283#false} is VALID [2020-07-10 14:40:53,967 INFO L280 TraceCheckUtils]: 25: Hoare triple {283#false} assume 0 == #t~ret8;havoc #t~ret8; {283#false} is VALID [2020-07-10 14:40:53,967 INFO L280 TraceCheckUtils]: 26: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-10 14:40:53,969 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:40:53,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403289936] [2020-07-10 14:40:53,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:40:53,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:40:53,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264473275] [2020-07-10 14:40:53,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:40:53,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:40:53,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:40:54,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:54,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:40:54,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:40:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:40:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:40:54,010 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 6 states. [2020-07-10 14:40:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:54,612 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-10 14:40:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:40:54,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:40:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:40:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:40:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:40:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:40:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:40:54,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:40:54,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:54,723 INFO L225 Difference]: With dead ends: 51 [2020-07-10 14:40:54,723 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:40:54,725 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:40:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:40:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:40:54,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:40:54,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:40:54,755 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:40:54,755 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:40:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:54,760 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:40:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:40:54,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:54,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:54,761 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:40:54,762 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:40:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:54,766 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:40:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:40:54,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:54,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:54,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:40:54,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:40:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:40:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:40:54,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2020-07-10 14:40:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:40:54,773 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:40:54,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:40:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:40:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:40:54,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:40:54,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:40:54,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:40:54,775 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:40:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:40:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1711130393, now seen corresponding path program 1 times [2020-07-10 14:40:54,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:40:54,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652228970] [2020-07-10 14:40:54,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:40:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:54,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-10 14:40:54,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:40:54,870 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #75#return; {518#true} is VALID [2020-07-10 14:40:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:54,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {518#true} is VALID [2020-07-10 14:40:54,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#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~union1;havoc #t~mem0;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; {518#true} is VALID [2020-07-10 14:40:54,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:40:54,987 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {518#true} is VALID [2020-07-10 14:40:54,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {518#true} is VALID [2020-07-10 14:40:54,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {518#true} is VALID [2020-07-10 14:40:54,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:54,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 |__fpclassify_double_#res|)} assume true; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:54,991 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {553#(<= 1 |__fpclassify_double_#res|)} {518#true} #79#return; {552#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:54,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-10 14:40:54,993 INFO L263 TraceCheckUtils]: 1: Hoare triple {518#true} call #t~ret4 := __fpclassify_double(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:54,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {518#true} is VALID [2020-07-10 14:40:54,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#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~union1;havoc #t~mem0;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; {518#true} is VALID [2020-07-10 14:40:54,993 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:40:54,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {518#true} is VALID [2020-07-10 14:40:54,994 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {518#true} is VALID [2020-07-10 14:40:54,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {518#true} is VALID [2020-07-10 14:40:54,996 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:54,996 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= 1 |__fpclassify_double_#res|)} assume true; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:54,997 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {553#(<= 1 |__fpclassify_double_#res|)} {518#true} #79#return; {552#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:54,998 INFO L280 TraceCheckUtils]: 11: Hoare triple {552#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {552#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:54,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {552#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {519#false} is VALID [2020-07-10 14:40:54,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:40:54,999 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:40:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:40:55,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:40:55,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:40:55,006 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:40:55,007 INFO L263 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:40:55,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-10 14:40:55,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:40:55,008 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #75#return; {518#true} is VALID [2020-07-10 14:40:55,008 INFO L263 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret9 := main(); {518#true} is VALID [2020-07-10 14:40:55,009 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {518#true} is VALID [2020-07-10 14:40:55,010 INFO L263 TraceCheckUtils]: 6: Hoare triple {518#true} call #t~ret7 := fmin_double(~x~0, ~y~0); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:55,010 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-10 14:40:55,011 INFO L263 TraceCheckUtils]: 8: Hoare triple {518#true} call #t~ret4 := __fpclassify_double(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:40:55,012 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {518#true} is VALID [2020-07-10 14:40:55,012 INFO L280 TraceCheckUtils]: 10: Hoare triple {518#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~union1;havoc #t~mem0;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; {518#true} is VALID [2020-07-10 14:40:55,012 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:40:55,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {518#true} is VALID [2020-07-10 14:40:55,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {518#true} is VALID [2020-07-10 14:40:55,013 INFO L280 TraceCheckUtils]: 14: Hoare triple {518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {518#true} is VALID [2020-07-10 14:40:55,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:55,015 INFO L280 TraceCheckUtils]: 16: Hoare triple {553#(<= 1 |__fpclassify_double_#res|)} assume true; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:40:55,016 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {553#(<= 1 |__fpclassify_double_#res|)} {518#true} #79#return; {552#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:55,017 INFO L280 TraceCheckUtils]: 18: Hoare triple {552#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {552#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:40:55,017 INFO L280 TraceCheckUtils]: 19: Hoare triple {552#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {519#false} is VALID [2020-07-10 14:40:55,018 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:40:55,018 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:40:55,018 INFO L280 TraceCheckUtils]: 22: Hoare triple {519#false} ~res~0 := #t~ret7;havoc #t~ret7; {519#false} is VALID [2020-07-10 14:40:55,019 INFO L263 TraceCheckUtils]: 23: Hoare triple {519#false} call #t~ret8 := isnan_double(~res~0); {518#true} is VALID [2020-07-10 14:40:55,019 INFO L280 TraceCheckUtils]: 24: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:40:55,019 INFO L280 TraceCheckUtils]: 25: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:40:55,019 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:40:55,020 INFO L280 TraceCheckUtils]: 27: Hoare triple {519#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {519#false} is VALID [2020-07-10 14:40:55,020 INFO L280 TraceCheckUtils]: 28: Hoare triple {519#false} assume 0 == #t~ret8;havoc #t~ret8; {519#false} is VALID [2020-07-10 14:40:55,020 INFO L280 TraceCheckUtils]: 29: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-10 14:40:55,022 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:40:55,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652228970] [2020-07-10 14:40:55,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:40:55,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:40:55,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362697289] [2020-07-10 14:40:55,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:40:55,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:40:55,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:40:55,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:55,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:40:55,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:40:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:40:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:40:55,070 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:40:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:55,633 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-10 14:40:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:40:55,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:40:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:40:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:40:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:40:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:40:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:40:55,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:40:55,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:40:55,753 INFO L225 Difference]: With dead ends: 55 [2020-07-10 14:40:55,754 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:40:55,755 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:40:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:40:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-10 14:40:55,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:40:55,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2020-07-10 14:40:55,799 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2020-07-10 14:40:55,799 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2020-07-10 14:40:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:55,806 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:40:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:40:55,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:55,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:55,807 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2020-07-10 14:40:55,808 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2020-07-10 14:40:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:40:55,819 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:40:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:40:55,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:40:55,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:40:55,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:40:55,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:40:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:40:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:40:55,831 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2020-07-10 14:40:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:40:55,831 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:40:55,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:40:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:40:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:40:55,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:40:55,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:40:55,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:40:55,836 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:40:55,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:40:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1076285094, now seen corresponding path program 1 times [2020-07-10 14:40:55,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:40:55,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989511328] [2020-07-10 14:40:55,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:40:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:40:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:40:56,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:40:56,125 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:40:56,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:40:56,180 WARN L170 areAnnotationChecker]: isnan_doubleENTRY has no Hoare annotation [2020-07-10 14:40:56,180 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: fmin_doubleENTRY has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: isnan_doubleFINAL has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:40:56,181 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 14:40:56,182 WARN L170 areAnnotationChecker]: isnan_doubleEXIT has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-10 14:40:56,183 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 14:40:56,184 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-10 14:40:56,184 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-10 14:40:56,184 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:40:56,184 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:40:56,184 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-10 14:40:56,184 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-10 14:40:56,185 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 14:40:56,185 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 14:40:56,185 WARN L170 areAnnotationChecker]: L65-2 has no Hoare annotation [2020-07-10 14:40:56,185 WARN L170 areAnnotationChecker]: L65-2 has no Hoare annotation [2020-07-10 14:40:56,185 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 14:40:56,186 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-10 14:40:56,186 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:40:56,186 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 14:40:56,186 WARN L170 areAnnotationChecker]: fmin_doubleFINAL has no Hoare annotation [2020-07-10 14:40:56,186 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 14:40:56,187 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 14:40:56,187 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 14:40:56,187 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 14:40:56,187 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:40:56,187 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:40:56,188 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 14:40:56,188 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 14:40:56,188 WARN L170 areAnnotationChecker]: fmin_doubleEXIT has no Hoare annotation [2020-07-10 14:40:56,188 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:40:56,188 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:40:56,189 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:40:56,189 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 14:40:56,189 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 14:40:56,189 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 14:40:56,189 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:40:56,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:40:56 BoogieIcfgContainer [2020-07-10 14:40:56,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:40:56,202 INFO L168 Benchmark]: Toolchain (without parser) took 4764.35 ms. Allocated memory was 136.8 MB in the beginning and 251.7 MB in the end (delta: 114.8 MB). Free memory was 101.6 MB in the beginning and 126.2 MB in the end (delta: -24.6 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:56,204 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.7 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:40:56,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.27 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 178.9 MB in the end (delta: -77.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:56,212 INFO L168 Benchmark]: Boogie Preprocessor took 45.67 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 176.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:56,214 INFO L168 Benchmark]: RCFGBuilder took 518.32 ms. Allocated memory is still 200.3 MB. Free memory was 176.3 MB in the beginning and 148.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:56,220 INFO L168 Benchmark]: TraceAbstraction took 3825.03 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 147.7 MB in the beginning and 126.2 MB in the end (delta: 21.6 MB). Peak memory consumption was 72.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:40:56,229 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 369.27 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 178.9 MB in the end (delta: -77.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.67 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 176.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 518.32 ms. Allocated memory is still 200.3 MB. Free memory was 176.3 MB in the beginning and 148.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3825.03 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 147.7 MB in the beginning and 126.2 MB in the end (delta: 21.6 MB). Peak memory consumption was 72.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 66]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L61] double x = 0.0 / 0.0; [L62] double y = 0.0 / 0.0; [L63] CALL, EXPR fmin_double(x, y) VAL [\old(x)=2147483652, \old(y)=2147483653] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=2147483652] [L18] __uint32_t msw, lsw; VAL [\old(x)=2147483652, x=2147483652] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=2147483652, lsw=1, msw=2147483647, x=2147483652] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=2147483652, lsw=1, msw=2147483647, x=2147483652] [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=2147483652, lsw=1, msw=2147483647, x=2147483652] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; VAL [\old(x)=2147483652, \result=0, lsw=1, msw=2147483647, x=2147483652] [L45] RET, EXPR __fpclassify_double(x) VAL [\old(x)=2147483652, \old(y)=2147483653, __fpclassify_double(x)=0, x=2147483652, y=2147483653] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; VAL [\old(x)=2147483652, \old(y)=2147483653, \result=2147483653, x=2147483652, y=2147483653] [L63] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=2147483653, x=2147483652, y=2147483653] [L63] double res = fmin_double(x, y); [L65] CALL, EXPR isnan_double(res) VAL [\old(x)=2147483653] [L16] return x != x; VAL [\old(x)=2147483653, \result=0, x=2147483653] [L65] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=2147483653, x=2147483652, y=2147483653] [L65] COND TRUE !isnan_double(res) [L66] __VERIFIER_error() VAL [res=2147483653, x=2147483652, y=2147483653] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 108 SDslu, 43 SDs, 0 SdLazy, 255 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 5222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...