/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_1231b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 11:58:14,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 11:58:14,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 11:58:14,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 11:58:14,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 11:58:14,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 11:58:14,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 11:58:14,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 11:58:14,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 11:58:14,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 11:58:14,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 11:58:14,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 11:58:14,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 11:58:14,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 11:58:14,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 11:58:14,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 11:58:14,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 11:58:14,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 11:58:14,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 11:58:14,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 11:58:14,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 11:58:14,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 11:58:14,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 11:58:14,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 11:58:14,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 11:58:14,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 11:58:14,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 11:58:14,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 11:58:14,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 11:58:14,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 11:58:14,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 11:58:14,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 11:58:14,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 11:58:14,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 11:58:14,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 11:58:14,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 11:58:14,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 11:58:14,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 11:58:14,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 11:58:14,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 11:58:14,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 11:58:14,331 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-08 11:58:14,346 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 11:58:14,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 11:58:14,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 11:58:14,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 11:58:14,348 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 11:58:14,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 11:58:14,348 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 11:58:14,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 11:58:14,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 11:58:14,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 11:58:14,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 11:58:14,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 11:58:14,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 11:58:14,350 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 11:58:14,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 11:58:14,350 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 11:58:14,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 11:58:14,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 11:58:14,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 11:58:14,351 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 11:58:14,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 11:58:14,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 11:58:14,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 11:58:14,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 11:58:14,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 11:58:14,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 11:58:14,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 11:58:14,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 11:58:14,353 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 11:58:14,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 11:58:14,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 11:58:14,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 11:58:14,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 11:58:14,663 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 11:58:14,663 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 11:58:14,664 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c [2020-07-08 11:58:14,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8caa9df/19756cf266eb4d5b8f3c807c689aa9e7/FLAG92b994a77 [2020-07-08 11:58:15,211 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 11:58:15,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c [2020-07-08 11:58:15,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8caa9df/19756cf266eb4d5b8f3c807c689aa9e7/FLAG92b994a77 [2020-07-08 11:58:15,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8caa9df/19756cf266eb4d5b8f3c807c689aa9e7 [2020-07-08 11:58:15,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 11:58:15,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 11:58:15,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 11:58:15,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 11:58:15,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 11:58:15,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:58:15" (1/1) ... [2020-07-08 11:58:15,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9aec2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:15, skipping insertion in model container [2020-07-08 11:58:15,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:58:15" (1/1) ... [2020-07-08 11:58:15,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 11:58:15,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 11:58:15,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 11:58:15,864 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 11:58:15,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 11:58:16,011 INFO L208 MainTranslator]: Completed translation [2020-07-08 11:58:16,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16 WrapperNode [2020-07-08 11:58:16,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 11:58:16,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 11:58:16,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 11:58:16,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 11:58:16,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (1/1) ... [2020-07-08 11:58:16,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (1/1) ... [2020-07-08 11:58:16,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (1/1) ... [2020-07-08 11:58:16,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (1/1) ... [2020-07-08 11:58:16,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (1/1) ... [2020-07-08 11:58:16,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (1/1) ... [2020-07-08 11:58:16,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (1/1) ... [2020-07-08 11:58:16,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 11:58:16,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 11:58:16,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 11:58:16,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 11:58:16,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (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-08 11:58:16,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 11:58:16,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 11:58:16,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-08 11:58:16,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-08 11:58:16,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-08 11:58:16,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 11:58:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 11:58:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-08 11:58:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-08 11:58:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-08 11:58:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 11:58:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 11:58:16,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 11:58:16,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 11:58:16,150 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-08 11:58:16,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 11:58:16,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 11:58:16,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 11:58:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 11:58:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 11:58:16,611 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 11:58:16,612 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 11:58:16,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:58:16 BoogieIcfgContainer [2020-07-08 11:58:16,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 11:58:16,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 11:58:16,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 11:58:16,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 11:58:16,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:58:15" (1/3) ... [2020-07-08 11:58:16,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe3f4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:58:16, skipping insertion in model container [2020-07-08 11:58:16,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:58:16" (2/3) ... [2020-07-08 11:58:16,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe3f4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:58:16, skipping insertion in model container [2020-07-08 11:58:16,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:58:16" (3/3) ... [2020-07-08 11:58:16,628 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2020-07-08 11:58:16,640 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 11:58:16,654 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 11:58:16,684 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 11:58:16,708 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 11:58:16,708 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 11:58:16,708 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 11:58:16,708 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 11:58:16,709 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 11:58:16,709 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 11:58:16,709 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 11:58:16,709 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 11:58:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-08 11:58:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 11:58:16,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:58:16,739 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-08 11:58:16,740 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:58:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:58:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash 969227935, now seen corresponding path program 1 times [2020-07-08 11:58:16,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:58:16,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329883551] [2020-07-08 11:58:16,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:58:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:17,030 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(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; {45#true} is VALID [2020-07-08 11:58:17,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-08 11:58:17,031 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #82#return; {45#true} is VALID [2020-07-08 11:58:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:17,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {45#true} is VALID [2020-07-08 11:58:17,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-08 11:58:17,046 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #78#return; {45#true} is VALID [2020-07-08 11:58:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:17,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(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; {45#true} is VALID [2020-07-08 11:58:17,109 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume !true; {46#false} is VALID [2020-07-08 11:58:17,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {46#false} is VALID [2020-07-08 11:58:17,110 INFO L280 TraceCheckUtils]: 3: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-08 11:58:17,110 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {46#false} {45#true} #86#return; {46#false} is VALID [2020-07-08 11:58:17,111 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {45#true} is VALID [2020-07-08 11:58:17,114 INFO L263 TraceCheckUtils]: 1: Hoare triple {45#true} call #t~ret4 := __fpclassify_double(~x); {65#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:17,114 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#(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; {45#true} is VALID [2020-07-08 11:58:17,115 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#true} assume !true; {46#false} is VALID [2020-07-08 11:58:17,116 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {46#false} is VALID [2020-07-08 11:58:17,116 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-08 11:58:17,117 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {46#false} {45#true} #86#return; {46#false} is VALID [2020-07-08 11:58:17,117 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {46#false} is VALID [2020-07-08 11:58:17,117 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {46#false} is VALID [2020-07-08 11:58:17,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-08 11:58:17,118 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {46#false} {45#true} #80#return; {46#false} is VALID [2020-07-08 11:58:17,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {64#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 11:58:17,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#(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; {45#true} is VALID [2020-07-08 11:58:17,122 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-08 11:58:17,123 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #82#return; {45#true} is VALID [2020-07-08 11:58:17,123 INFO L263 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret10 := main(); {45#true} is VALID [2020-07-08 11:58:17,124 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {45#true} is VALID [2020-07-08 11:58:17,124 INFO L263 TraceCheckUtils]: 6: Hoare triple {45#true} call #t~ret8 := isnan_double(~x~0); {45#true} is VALID [2020-07-08 11:58:17,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {45#true} is VALID [2020-07-08 11:58:17,125 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-08 11:58:17,125 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {45#true} {45#true} #78#return; {45#true} is VALID [2020-07-08 11:58:17,126 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {45#true} is VALID [2020-07-08 11:58:17,126 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#true} assume 0 == #t~ret8;havoc #t~ret8; {45#true} is VALID [2020-07-08 11:58:17,128 INFO L263 TraceCheckUtils]: 12: Hoare triple {45#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {65#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:17,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {65#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {45#true} is VALID [2020-07-08 11:58:17,131 INFO L263 TraceCheckUtils]: 14: Hoare triple {45#true} call #t~ret4 := __fpclassify_double(~x); {65#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:17,131 INFO L280 TraceCheckUtils]: 15: Hoare triple {65#(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; {45#true} is VALID [2020-07-08 11:58:17,132 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#true} assume !true; {46#false} is VALID [2020-07-08 11:58:17,133 INFO L280 TraceCheckUtils]: 17: Hoare triple {46#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {46#false} is VALID [2020-07-08 11:58:17,133 INFO L280 TraceCheckUtils]: 18: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-08 11:58:17,134 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {46#false} {45#true} #86#return; {46#false} is VALID [2020-07-08 11:58:17,134 INFO L280 TraceCheckUtils]: 20: Hoare triple {46#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {46#false} is VALID [2020-07-08 11:58:17,134 INFO L280 TraceCheckUtils]: 21: Hoare triple {46#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {46#false} is VALID [2020-07-08 11:58:17,135 INFO L280 TraceCheckUtils]: 22: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-08 11:58:17,135 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {46#false} {45#true} #80#return; {46#false} is VALID [2020-07-08 11:58:17,136 INFO L280 TraceCheckUtils]: 24: Hoare triple {46#false} ~res~0 := #t~ret9;havoc #t~ret9; {46#false} is VALID [2020-07-08 11:58:17,136 INFO L280 TraceCheckUtils]: 25: Hoare triple {46#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {46#false} is VALID [2020-07-08 11:58:17,136 INFO L280 TraceCheckUtils]: 26: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-08 11:58:17,140 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-08 11:58:17,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329883551] [2020-07-08 11:58:17,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:58:17,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 11:58:17,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394219129] [2020-07-08 11:58:17,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-08 11:58:17,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:58:17,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 11:58:17,216 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-08 11:58:17,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 11:58:17,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:58:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 11:58:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 11:58:17,230 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2020-07-08 11:58:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:17,727 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2020-07-08 11:58:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 11:58:17,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-08 11:58:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:58:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 11:58:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2020-07-08 11:58:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 11:58:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2020-07-08 11:58:17,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2020-07-08 11:58:17,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:58:17,949 INFO L225 Difference]: With dead ends: 72 [2020-07-08 11:58:17,949 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 11:58:17,953 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-08 11:58:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 11:58:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-08 11:58:18,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:58:18,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-08 11:58:18,018 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-08 11:58:18,018 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-08 11:58:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:18,025 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-08 11:58:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-08 11:58:18,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:58:18,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:58:18,026 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-08 11:58:18,026 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-08 11:58:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:18,032 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-08 11:58:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-08 11:58:18,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:58:18,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:58:18,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:58:18,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:58:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 11:58:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-07-08 11:58:18,040 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2020-07-08 11:58:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:58:18,040 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-07-08 11:58:18,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 11:58:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-08 11:58:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 11:58:18,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:58:18,042 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] [2020-07-08 11:58:18,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 11:58:18,043 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:58:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:58:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 627032795, now seen corresponding path program 1 times [2020-07-08 11:58:18,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:58:18,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951709587] [2020-07-08 11:58:18,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:58:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:18,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#(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; {286#true} is VALID [2020-07-08 11:58:18,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-08 11:58:18,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} #82#return; {286#true} is VALID [2020-07-08 11:58:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:18,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {286#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {286#true} is VALID [2020-07-08 11:58:18,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-08 11:58:18,214 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} #78#return; {286#true} is VALID [2020-07-08 11:58:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:18,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#(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; {286#true} is VALID [2020-07-08 11:58:18,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#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~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {286#true} is VALID [2020-07-08 11:58:18,364 INFO L280 TraceCheckUtils]: 2: Hoare triple {286#true} goto; {286#true} is VALID [2020-07-08 11:58:18,365 INFO L280 TraceCheckUtils]: 3: Hoare triple {286#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:18,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {315#(<= 2 |__fpclassify_double_#res|)} assume true; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:18,367 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {315#(<= 2 |__fpclassify_double_#res|)} {286#true} #86#return; {314#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:18,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {286#true} is VALID [2020-07-08 11:58:18,369 INFO L263 TraceCheckUtils]: 1: Hoare triple {286#true} call #t~ret4 := __fpclassify_double(~x); {307#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:18,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#(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; {286#true} is VALID [2020-07-08 11:58:18,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {286#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~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {286#true} is VALID [2020-07-08 11:58:18,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {286#true} goto; {286#true} is VALID [2020-07-08 11:58:18,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {286#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:18,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {315#(<= 2 |__fpclassify_double_#res|)} assume true; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:18,373 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {315#(<= 2 |__fpclassify_double_#res|)} {286#true} #86#return; {314#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:18,374 INFO L280 TraceCheckUtils]: 8: Hoare triple {314#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {314#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:18,375 INFO L280 TraceCheckUtils]: 9: Hoare triple {314#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {287#false} is VALID [2020-07-08 11:58:18,375 INFO L280 TraceCheckUtils]: 10: Hoare triple {287#false} assume true; {287#false} is VALID [2020-07-08 11:58:18,375 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {287#false} {286#true} #80#return; {287#false} is VALID [2020-07-08 11:58:18,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 11:58:18,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#(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; {286#true} is VALID [2020-07-08 11:58:18,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-08 11:58:18,377 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} #82#return; {286#true} is VALID [2020-07-08 11:58:18,378 INFO L263 TraceCheckUtils]: 4: Hoare triple {286#true} call #t~ret10 := main(); {286#true} is VALID [2020-07-08 11:58:18,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {286#true} ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {286#true} is VALID [2020-07-08 11:58:18,378 INFO L263 TraceCheckUtils]: 6: Hoare triple {286#true} call #t~ret8 := isnan_double(~x~0); {286#true} is VALID [2020-07-08 11:58:18,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {286#true} is VALID [2020-07-08 11:58:18,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-08 11:58:18,379 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {286#true} {286#true} #78#return; {286#true} is VALID [2020-07-08 11:58:18,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {286#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {286#true} is VALID [2020-07-08 11:58:18,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {286#true} assume 0 == #t~ret8;havoc #t~ret8; {286#true} is VALID [2020-07-08 11:58:18,381 INFO L263 TraceCheckUtils]: 12: Hoare triple {286#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {307#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:18,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {286#true} is VALID [2020-07-08 11:58:18,383 INFO L263 TraceCheckUtils]: 14: Hoare triple {286#true} call #t~ret4 := __fpclassify_double(~x); {307#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:18,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {307#(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; {286#true} is VALID [2020-07-08 11:58:18,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {286#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~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {286#true} is VALID [2020-07-08 11:58:18,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {286#true} goto; {286#true} is VALID [2020-07-08 11:58:18,385 INFO L280 TraceCheckUtils]: 18: Hoare triple {286#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:18,385 INFO L280 TraceCheckUtils]: 19: Hoare triple {315#(<= 2 |__fpclassify_double_#res|)} assume true; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:18,387 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {315#(<= 2 |__fpclassify_double_#res|)} {286#true} #86#return; {314#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:18,387 INFO L280 TraceCheckUtils]: 21: Hoare triple {314#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {314#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:18,388 INFO L280 TraceCheckUtils]: 22: Hoare triple {314#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {287#false} is VALID [2020-07-08 11:58:18,388 INFO L280 TraceCheckUtils]: 23: Hoare triple {287#false} assume true; {287#false} is VALID [2020-07-08 11:58:18,389 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {287#false} {286#true} #80#return; {287#false} is VALID [2020-07-08 11:58:18,389 INFO L280 TraceCheckUtils]: 25: Hoare triple {287#false} ~res~0 := #t~ret9;havoc #t~ret9; {287#false} is VALID [2020-07-08 11:58:18,389 INFO L280 TraceCheckUtils]: 26: Hoare triple {287#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {287#false} is VALID [2020-07-08 11:58:18,390 INFO L280 TraceCheckUtils]: 27: Hoare triple {287#false} assume !false; {287#false} is VALID [2020-07-08 11:58:18,391 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-08 11:58:18,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951709587] [2020-07-08 11:58:18,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:58:18,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 11:58:18,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069721226] [2020-07-08 11:58:18,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-08 11:58:18,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:58:18,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 11:58:18,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:58:18,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 11:58:18,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:58:18,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 11:58:18,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 11:58:18,433 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 6 states. [2020-07-08 11:58:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:19,048 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-08 11:58:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 11:58:19,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-08 11:58:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:58:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:58:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-08 11:58:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:58:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-08 11:58:19,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-08 11:58:19,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:58:19,148 INFO L225 Difference]: With dead ends: 47 [2020-07-08 11:58:19,148 INFO L226 Difference]: Without dead ends: 41 [2020-07-08 11:58:19,149 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-08 11:58:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-08 11:58:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-08 11:58:19,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:58:19,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-08 11:58:19,183 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-08 11:58:19,183 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-08 11:58:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:19,188 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-08 11:58:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-08 11:58:19,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:58:19,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:58:19,189 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-08 11:58:19,189 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-08 11:58:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:19,193 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-08 11:58:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-08 11:58:19,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:58:19,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:58:19,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:58:19,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:58:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-08 11:58:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-08 11:58:19,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2020-07-08 11:58:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:58:19,199 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-08 11:58:19,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 11:58:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-08 11:58:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 11:58:19,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:58:19,201 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, 1] [2020-07-08 11:58:19,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 11:58:19,202 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:58:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:58:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash 151786008, now seen corresponding path program 1 times [2020-07-08 11:58:19,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:58:19,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624563182] [2020-07-08 11:58:19,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:58:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:19,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(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; {519#true} is VALID [2020-07-08 11:58:19,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-08 11:58:19,275 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #82#return; {519#true} is VALID [2020-07-08 11:58:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:19,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {519#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {519#true} is VALID [2020-07-08 11:58:19,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-08 11:58:19,280 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #78#return; {519#true} is VALID [2020-07-08 11:58:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:58:19,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {543#(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; {519#true} is VALID [2020-07-08 11:58:19,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#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~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {519#true} is VALID [2020-07-08 11:58:19,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#true} goto; {519#true} is VALID [2020-07-08 11:58:19,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {519#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {519#true} is VALID [2020-07-08 11:58:19,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {519#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {519#true} is VALID [2020-07-08 11:58:19,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {519#true} is VALID [2020-07-08 11:58:19,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {519#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:19,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {554#(<= 1 |__fpclassify_double_#res|)} assume true; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:19,413 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {554#(<= 1 |__fpclassify_double_#res|)} {519#true} #86#return; {553#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:19,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {543#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {519#true} is VALID [2020-07-08 11:58:19,415 INFO L263 TraceCheckUtils]: 1: Hoare triple {519#true} call #t~ret4 := __fpclassify_double(~x); {543#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:19,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {543#(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; {519#true} is VALID [2020-07-08 11:58:19,416 INFO L280 TraceCheckUtils]: 3: Hoare triple {519#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~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {519#true} is VALID [2020-07-08 11:58:19,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {519#true} goto; {519#true} is VALID [2020-07-08 11:58:19,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {519#true} is VALID [2020-07-08 11:58:19,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {519#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {519#true} is VALID [2020-07-08 11:58:19,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {519#true} is VALID [2020-07-08 11:58:19,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:19,419 INFO L280 TraceCheckUtils]: 9: Hoare triple {554#(<= 1 |__fpclassify_double_#res|)} assume true; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:19,420 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {554#(<= 1 |__fpclassify_double_#res|)} {519#true} #86#return; {553#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:19,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {553#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {553#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:19,421 INFO L280 TraceCheckUtils]: 12: Hoare triple {553#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {520#false} is VALID [2020-07-08 11:58:19,422 INFO L280 TraceCheckUtils]: 13: Hoare triple {520#false} assume true; {520#false} is VALID [2020-07-08 11:58:19,422 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {520#false} {519#true} #80#return; {520#false} is VALID [2020-07-08 11:58:19,423 INFO L263 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 11:58:19,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#(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; {519#true} is VALID [2020-07-08 11:58:19,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-08 11:58:19,424 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #82#return; {519#true} is VALID [2020-07-08 11:58:19,424 INFO L263 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret10 := main(); {519#true} is VALID [2020-07-08 11:58:19,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#true} ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {519#true} is VALID [2020-07-08 11:58:19,425 INFO L263 TraceCheckUtils]: 6: Hoare triple {519#true} call #t~ret8 := isnan_double(~x~0); {519#true} is VALID [2020-07-08 11:58:19,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {519#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {519#true} is VALID [2020-07-08 11:58:19,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-08 11:58:19,426 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {519#true} {519#true} #78#return; {519#true} is VALID [2020-07-08 11:58:19,426 INFO L280 TraceCheckUtils]: 10: Hoare triple {519#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {519#true} is VALID [2020-07-08 11:58:19,426 INFO L280 TraceCheckUtils]: 11: Hoare triple {519#true} assume 0 == #t~ret8;havoc #t~ret8; {519#true} is VALID [2020-07-08 11:58:19,428 INFO L263 TraceCheckUtils]: 12: Hoare triple {519#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {543#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:19,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {543#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {519#true} is VALID [2020-07-08 11:58:19,430 INFO L263 TraceCheckUtils]: 14: Hoare triple {519#true} call #t~ret4 := __fpclassify_double(~x); {543#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:58:19,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {543#(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; {519#true} is VALID [2020-07-08 11:58:19,430 INFO L280 TraceCheckUtils]: 16: Hoare triple {519#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~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {519#true} is VALID [2020-07-08 11:58:19,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {519#true} goto; {519#true} is VALID [2020-07-08 11:58:19,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {519#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {519#true} is VALID [2020-07-08 11:58:19,431 INFO L280 TraceCheckUtils]: 19: Hoare triple {519#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {519#true} is VALID [2020-07-08 11:58:19,432 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {519#true} is VALID [2020-07-08 11:58:19,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {519#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:19,434 INFO L280 TraceCheckUtils]: 22: Hoare triple {554#(<= 1 |__fpclassify_double_#res|)} assume true; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 11:58:19,437 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {554#(<= 1 |__fpclassify_double_#res|)} {519#true} #86#return; {553#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:19,438 INFO L280 TraceCheckUtils]: 24: Hoare triple {553#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {553#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 11:58:19,439 INFO L280 TraceCheckUtils]: 25: Hoare triple {553#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {520#false} is VALID [2020-07-08 11:58:19,439 INFO L280 TraceCheckUtils]: 26: Hoare triple {520#false} assume true; {520#false} is VALID [2020-07-08 11:58:19,439 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {520#false} {519#true} #80#return; {520#false} is VALID [2020-07-08 11:58:19,440 INFO L280 TraceCheckUtils]: 28: Hoare triple {520#false} ~res~0 := #t~ret9;havoc #t~ret9; {520#false} is VALID [2020-07-08 11:58:19,440 INFO L280 TraceCheckUtils]: 29: Hoare triple {520#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {520#false} is VALID [2020-07-08 11:58:19,440 INFO L280 TraceCheckUtils]: 30: Hoare triple {520#false} assume !false; {520#false} is VALID [2020-07-08 11:58:19,442 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-08 11:58:19,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624563182] [2020-07-08 11:58:19,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:58:19,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 11:58:19,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008691212] [2020-07-08 11:58:19,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-08 11:58:19,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:58:19,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 11:58:19,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:58:19,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 11:58:19,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:58:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 11:58:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 11:58:19,481 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 6 states. [2020-07-08 11:58:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:20,002 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-07-08 11:58:20,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 11:58:20,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-08 11:58:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:58:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:58:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-08 11:58:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:58:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-08 11:58:20,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-08 11:58:20,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:58:20,086 INFO L225 Difference]: With dead ends: 51 [2020-07-08 11:58:20,086 INFO L226 Difference]: Without dead ends: 45 [2020-07-08 11:58:20,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-08 11:58:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-08 11:58:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-08 11:58:20,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:58:20,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2020-07-08 11:58:20,124 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2020-07-08 11:58:20,125 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2020-07-08 11:58:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:20,129 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-08 11:58:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-08 11:58:20,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:58:20,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:58:20,130 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2020-07-08 11:58:20,131 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2020-07-08 11:58:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:58:20,134 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-08 11:58:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-08 11:58:20,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:58:20,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:58:20,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:58:20,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:58:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-08 11:58:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-08 11:58:20,138 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2020-07-08 11:58:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:58:20,139 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-08 11:58:20,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 11:58:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-08 11:58:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 11:58:20,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:58:20,140 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, 1] [2020-07-08 11:58:20,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 11:58:20,141 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:58:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:58:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash -44727497, now seen corresponding path program 1 times [2020-07-08 11:58:20,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:58:20,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737433094] [2020-07-08 11:58:20,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:58:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 11:58:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 11:58:20,306 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 11:58:20,307 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 11:58:20,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 11:58:20,338 WARN L170 areAnnotationChecker]: isnan_doubleENTRY has no Hoare annotation [2020-07-08 11:58:20,338 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 11:58:20,338 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-08 11:58:20,338 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 11:58:20,339 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 11:58:20,339 WARN L170 areAnnotationChecker]: fmin_doubleENTRY has no Hoare annotation [2020-07-08 11:58:20,339 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 11:58:20,339 WARN L170 areAnnotationChecker]: isnan_doubleFINAL has no Hoare annotation [2020-07-08 11:58:20,339 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 11:58:20,339 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 11:58:20,339 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: isnan_doubleEXIT has no Hoare annotation [2020-07-08 11:58:20,340 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-08 11:58:20,341 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 11:58:20,342 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: fmin_doubleFINAL has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: L62-4 has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-08 11:58:20,343 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: fmin_doubleEXIT has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-08 11:58:20,344 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 11:58:20,345 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 11:58:20,345 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 11:58:20,345 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-08 11:58:20,345 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-08 11:58:20,345 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-08 11:58:20,345 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-08 11:58:20,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:58:20 BoogieIcfgContainer [2020-07-08 11:58:20,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 11:58:20,355 INFO L168 Benchmark]: Toolchain (without parser) took 4727.66 ms. Allocated memory was 137.9 MB in the beginning and 248.0 MB in the end (delta: 110.1 MB). Free memory was 102.4 MB in the beginning and 95.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 116.6 MB. Max. memory is 7.1 GB. [2020-07-08 11:58:20,355 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 11:58:20,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.64 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 180.3 MB in the end (delta: -78.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2020-07-08 11:58:20,357 INFO L168 Benchmark]: Boogie Preprocessor took 54.36 ms. Allocated memory is still 201.9 MB. Free memory was 180.3 MB in the beginning and 178.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-08 11:58:20,358 INFO L168 Benchmark]: RCFGBuilder took 551.10 ms. Allocated memory is still 201.9 MB. Free memory was 177.0 MB in the beginning and 148.9 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-08 11:58:20,359 INFO L168 Benchmark]: TraceAbstraction took 3731.25 ms. Allocated memory was 201.9 MB in the beginning and 248.0 MB in the end (delta: 46.1 MB). Free memory was 147.9 MB in the beginning and 95.9 MB in the end (delta: 52.0 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. [2020-07-08 11:58:20,362 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 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 384.64 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 180.3 MB in the end (delta: -78.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.36 ms. Allocated memory is still 201.9 MB. Free memory was 180.3 MB in the beginning and 178.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 551.10 ms. Allocated memory is still 201.9 MB. Free memory was 177.0 MB in the beginning and 148.9 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3731.25 ms. Allocated memory was 201.9 MB in the beginning and 248.0 MB in the end (delta: 46.1 MB). Free memory was 147.9 MB in the beginning and 95.9 MB in the end (delta: 52.0 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; VAL [x=2147483651] [L62] CALL, EXPR isnan_double(x) VAL [\old(x)=2147483651] [L16] return x != x; VAL [\old(x)=2147483651, \result=0, x=2147483651] [L62] RET, EXPR isnan_double(x) VAL [isnan_double(x)=0, x=2147483651] [L62] COND TRUE !isnan_double(x) [L64] CALL, EXPR fmin_double(x, y) VAL [\old(x)=2147483651, \old(y)=2147483650] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=2147483651] [L18] __uint32_t msw, lsw; VAL [\old(x)=2147483651, x=2147483651] [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)=2147483651, lsw=1, msw=2147483647, x=2147483651] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=2147483651, lsw=1, msw=2147483647, x=2147483651] [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=2147483651, lsw=1, msw=2147483647, x=2147483651] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; VAL [\old(x)=2147483651, \result=0, lsw=1, msw=2147483647, x=2147483651] [L45] RET, EXPR __fpclassify_double(x) VAL [\old(x)=2147483651, \old(y)=2147483650, __fpclassify_double(x)=0, x=2147483651, y=2147483650] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; VAL [\old(x)=2147483651, \old(y)=2147483650, \result=2147483650, x=2147483651, y=2147483650] [L64] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=2147483650, x=2147483651, y=2147483650] [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x VAL [res=2147483650, x=2147483651, y=2147483650] [L68] __VERIFIER_error() VAL [res=2147483650, x=2147483651, y=2147483650] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 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: 116 SDtfs, 124 SDslu, 43 SDs, 0 SdLazy, 254 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 5500 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...