/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 21:48:08,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 21:48:08,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 21:48:08,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 21:48:08,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 21:48:08,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 21:48:08,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 21:48:08,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 21:48:08,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 21:48:08,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 21:48:08,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 21:48:08,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 21:48:08,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 21:48:08,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 21:48:08,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 21:48:08,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 21:48:08,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 21:48:08,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 21:48:08,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 21:48:08,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 21:48:08,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 21:48:08,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 21:48:08,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 21:48:08,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 21:48:08,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 21:48:08,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 21:48:08,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 21:48:08,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 21:48:08,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 21:48:08,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 21:48:08,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 21:48:08,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 21:48:08,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 21:48:08,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 21:48:08,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 21:48:08,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 21:48:08,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 21:48:08,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 21:48:08,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 21:48:08,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 21:48:08,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 21:48:08,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 21:48:08,585 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 21:48:08,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 21:48:08,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 21:48:08,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 21:48:08,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 21:48:08,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 21:48:08,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 21:48:08,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 21:48:08,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 21:48:08,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 21:48:08,590 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 21:48:08,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 21:48:08,591 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 21:48:08,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 21:48:08,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 21:48:08,593 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 21:48:08,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 21:48:08,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 21:48:08,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:48:08,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 21:48:08,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 21:48:08,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 21:48:08,595 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 21:48:08,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 21:48:08,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 21:48:08,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 21:48:08,878 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 21:48:08,879 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 21:48:08,879 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 21:48:08,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d965c1f/edb5ac45c6d6435084a6138c0db56b62/FLAGf262abed0 [2020-07-08 21:48:09,417 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 21:48:09,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c [2020-07-08 21:48:09,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d965c1f/edb5ac45c6d6435084a6138c0db56b62/FLAGf262abed0 [2020-07-08 21:48:09,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d965c1f/edb5ac45c6d6435084a6138c0db56b62 [2020-07-08 21:48:09,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 21:48:09,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 21:48:09,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 21:48:09,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 21:48:09,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 21:48:09,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:48:09" (1/1) ... [2020-07-08 21:48:09,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf275e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:09, skipping insertion in model container [2020-07-08 21:48:09,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:48:09" (1/1) ... [2020-07-08 21:48:09,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 21:48:09,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 21:48:10,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:48:10,018 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 21:48:10,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:48:10,161 INFO L208 MainTranslator]: Completed translation [2020-07-08 21:48:10,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10 WrapperNode [2020-07-08 21:48:10,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 21:48:10,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 21:48:10,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 21:48:10,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 21:48:10,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (1/1) ... [2020-07-08 21:48:10,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (1/1) ... [2020-07-08 21:48:10,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (1/1) ... [2020-07-08 21:48:10,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (1/1) ... [2020-07-08 21:48:10,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (1/1) ... [2020-07-08 21:48:10,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (1/1) ... [2020-07-08 21:48:10,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (1/1) ... [2020-07-08 21:48:10,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 21:48:10,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 21:48:10,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 21:48:10,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 21:48:10,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (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 21:48:10,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 21:48:10,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 21:48:10,271 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-08 21:48:10,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-08 21:48:10,271 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-08 21:48:10,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 21:48:10,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 21:48:10,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-08 21:48:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-08 21:48:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-08 21:48:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 21:48:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 21:48:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 21:48:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 21:48:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-08 21:48:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 21:48:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 21:48:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 21:48:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 21:48:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 21:48:10,752 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 21:48:10,752 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 21:48:10,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:48:10 BoogieIcfgContainer [2020-07-08 21:48:10,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 21:48:10,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 21:48:10,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 21:48:10,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 21:48:10,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 09:48:09" (1/3) ... [2020-07-08 21:48:10,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c598e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:48:10, skipping insertion in model container [2020-07-08 21:48:10,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:10" (2/3) ... [2020-07-08 21:48:10,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c598e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:48:10, skipping insertion in model container [2020-07-08 21:48:10,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:48:10" (3/3) ... [2020-07-08 21:48:10,765 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2020-07-08 21:48:10,776 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 21:48:10,784 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 21:48:10,798 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 21:48:10,820 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 21:48:10,820 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 21:48:10,820 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 21:48:10,820 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 21:48:10,821 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 21:48:10,821 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 21:48:10,821 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 21:48:10,821 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 21:48:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-08 21:48:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 21:48:10,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:10,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:48:10,849 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1497092675, now seen corresponding path program 1 times [2020-07-08 21:48:10,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:10,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538985071] [2020-07-08 21:48:10,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:11,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {84#true} is VALID [2020-07-08 21:48:11,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-08 21:48:11,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-08 21:48:11,089 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 21:48:11,090 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {84#true} {84#true} #121#return; {84#true} is VALID [2020-07-08 21:48:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:11,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-08 21:48:11,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-08 21:48:11,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 21:48:11,106 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-08 21:48:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:11,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 21:48:11,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-08 21:48:11,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-08 21:48:11,156 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-08 21:48:11,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-08 21:48:11,157 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-08 21:48:11,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 21:48:11,158 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {85#false} {84#true} #125#return; {85#false} is VALID [2020-07-08 21:48:11,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 21:48:11,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-08 21:48:11,162 INFO L263 TraceCheckUtils]: 2: Hoare triple {84#true} call #t~ret4 := __fpclassify_double(~x); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:11,163 INFO L280 TraceCheckUtils]: 3: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 21:48:11,163 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-08 21:48:11,164 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-08 21:48:11,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-08 21:48:11,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-08 21:48:11,167 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-08 21:48:11,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 21:48:11,168 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {85#false} {84#true} #125#return; {85#false} is VALID [2020-07-08 21:48:11,168 INFO L280 TraceCheckUtils]: 11: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-08 21:48:11,169 INFO L280 TraceCheckUtils]: 12: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-08 21:48:11,169 INFO L280 TraceCheckUtils]: 13: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-08 21:48:11,170 INFO L280 TraceCheckUtils]: 14: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-08 21:48:11,170 INFO L280 TraceCheckUtils]: 15: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 21:48:11,170 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-08 21:48:11,173 INFO L263 TraceCheckUtils]: 0: Hoare triple {84#true} call ULTIMATE.init(); {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 21:48:11,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {84#true} is VALID [2020-07-08 21:48:11,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-08 21:48:11,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-08 21:48:11,176 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 21:48:11,176 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #121#return; {84#true} is VALID [2020-07-08 21:48:11,176 INFO L263 TraceCheckUtils]: 6: Hoare triple {84#true} call #t~ret10 := main(); {84#true} is VALID [2020-07-08 21:48:11,177 INFO L280 TraceCheckUtils]: 7: Hoare triple {84#true} ~x~0 := #t~nondet7; {84#true} is VALID [2020-07-08 21:48:11,177 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} havoc #t~nondet7; {84#true} is VALID [2020-07-08 21:48:11,178 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {84#true} is VALID [2020-07-08 21:48:11,178 INFO L263 TraceCheckUtils]: 10: Hoare triple {84#true} call #t~ret8 := isnan_double(~x~0); {84#true} is VALID [2020-07-08 21:48:11,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-08 21:48:11,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-08 21:48:11,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 21:48:11,180 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-08 21:48:11,180 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {84#true} is VALID [2020-07-08 21:48:11,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#true} assume 0 == #t~ret8; {84#true} is VALID [2020-07-08 21:48:11,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc #t~ret8; {84#true} is VALID [2020-07-08 21:48:11,183 INFO L263 TraceCheckUtils]: 18: Hoare triple {84#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:11,183 INFO L280 TraceCheckUtils]: 19: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 21:48:11,184 INFO L280 TraceCheckUtils]: 20: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-08 21:48:11,186 INFO L263 TraceCheckUtils]: 21: Hoare triple {84#true} call #t~ret4 := __fpclassify_double(~x); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:11,187 INFO L280 TraceCheckUtils]: 22: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 21:48:11,187 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-08 21:48:11,187 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-08 21:48:11,188 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-08 21:48:11,189 INFO L280 TraceCheckUtils]: 26: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-08 21:48:11,189 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-08 21:48:11,190 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 21:48:11,190 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {85#false} {84#true} #125#return; {85#false} is VALID [2020-07-08 21:48:11,190 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-08 21:48:11,191 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-08 21:48:11,191 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-08 21:48:11,191 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-08 21:48:11,192 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 21:48:11,192 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-08 21:48:11,193 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} ~res~0 := #t~ret9; {85#false} is VALID [2020-07-08 21:48:11,193 INFO L280 TraceCheckUtils]: 37: Hoare triple {85#false} havoc #t~ret9; {85#false} is VALID [2020-07-08 21:48:11,193 INFO L280 TraceCheckUtils]: 38: Hoare triple {85#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {85#false} is VALID [2020-07-08 21:48:11,194 INFO L280 TraceCheckUtils]: 39: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-08 21:48:11,198 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 21:48:11,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538985071] [2020-07-08 21:48:11,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:48:11,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 21:48:11,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263756917] [2020-07-08 21:48:11,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 21:48:11,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:48:11,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 21:48:11,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:11,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 21:48:11,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:48:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 21:48:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 21:48:11,297 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2020-07-08 21:48:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:11,949 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2020-07-08 21:48:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 21:48:11,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 21:48:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:48:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:48:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-08 21:48:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:48:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-08 21:48:11,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-08 21:48:12,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:12,232 INFO L225 Difference]: With dead ends: 141 [2020-07-08 21:48:12,233 INFO L226 Difference]: Without dead ends: 74 [2020-07-08 21:48:12,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:48:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-08 21:48:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-08 21:48:12,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:48:12,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-08 21:48:12,351 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-08 21:48:12,351 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-08 21:48:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:12,359 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-08 21:48:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-08 21:48:12,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:12,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:12,362 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-08 21:48:12,362 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-08 21:48:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:12,369 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-08 21:48:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-08 21:48:12,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:12,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:12,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:48:12,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:48:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-08 21:48:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2020-07-08 21:48:12,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 40 [2020-07-08 21:48:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:48:12,378 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2020-07-08 21:48:12,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 21:48:12,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2020-07-08 21:48:12,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-08 21:48:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 21:48:12,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:12,488 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, 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 21:48:12,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 21:48:12,489 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2105627481, now seen corresponding path program 1 times [2020-07-08 21:48:12,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:12,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605313485] [2020-07-08 21:48:12,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:12,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {705#true} is VALID [2020-07-08 21:48:12,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-08 21:48:12,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-08 21:48:12,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 21:48:12,574 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {705#true} {705#true} #121#return; {705#true} is VALID [2020-07-08 21:48:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:12,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-08 21:48:12,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-08 21:48:12,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 21:48:12,580 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-08 21:48:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:12,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 21:48:12,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-08 21:48:12,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-08 21:48:12,745 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {705#true} is VALID [2020-07-08 21:48:12,745 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {705#true} is VALID [2020-07-08 21:48:12,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {705#true} is VALID [2020-07-08 21:48:12,746 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-08 21:48:12,746 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {705#true} is VALID [2020-07-08 21:48:12,747 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-08 21:48:12,747 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-08 21:48:12,747 INFO L280 TraceCheckUtils]: 10: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {705#true} is VALID [2020-07-08 21:48:12,748 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-08 21:48:12,748 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {705#true} is VALID [2020-07-08 21:48:12,748 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-08 21:48:12,748 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-08 21:48:12,749 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {705#true} is VALID [2020-07-08 21:48:12,749 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-08 21:48:12,749 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-08 21:48:12,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-08 21:48:12,750 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:12,751 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:12,752 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #125#return; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:12,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 21:48:12,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-08 21:48:12,755 INFO L263 TraceCheckUtils]: 2: Hoare triple {705#true} call #t~ret4 := __fpclassify_double(~x); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:12,755 INFO L280 TraceCheckUtils]: 3: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 21:48:12,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-08 21:48:12,756 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-08 21:48:12,756 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {705#true} is VALID [2020-07-08 21:48:12,756 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {705#true} is VALID [2020-07-08 21:48:12,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {705#true} is VALID [2020-07-08 21:48:12,757 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-08 21:48:12,757 INFO L280 TraceCheckUtils]: 10: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {705#true} is VALID [2020-07-08 21:48:12,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-08 21:48:12,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-08 21:48:12,758 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {705#true} is VALID [2020-07-08 21:48:12,758 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-08 21:48:12,758 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {705#true} is VALID [2020-07-08 21:48:12,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-08 21:48:12,759 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-08 21:48:12,759 INFO L280 TraceCheckUtils]: 18: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {705#true} is VALID [2020-07-08 21:48:12,760 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-08 21:48:12,760 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-08 21:48:12,760 INFO L280 TraceCheckUtils]: 21: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-08 21:48:12,761 INFO L280 TraceCheckUtils]: 22: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:12,762 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:12,763 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #125#return; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:12,764 INFO L280 TraceCheckUtils]: 25: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:12,764 INFO L280 TraceCheckUtils]: 26: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-08 21:48:12,765 INFO L280 TraceCheckUtils]: 27: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-08 21:48:12,765 INFO L280 TraceCheckUtils]: 28: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-08 21:48:12,765 INFO L280 TraceCheckUtils]: 29: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-08 21:48:12,766 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-08 21:48:12,768 INFO L263 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 21:48:12,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {705#true} is VALID [2020-07-08 21:48:12,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-08 21:48:12,769 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-08 21:48:12,769 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 21:48:12,770 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {705#true} {705#true} #121#return; {705#true} is VALID [2020-07-08 21:48:12,770 INFO L263 TraceCheckUtils]: 6: Hoare triple {705#true} call #t~ret10 := main(); {705#true} is VALID [2020-07-08 21:48:12,770 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} ~x~0 := #t~nondet7; {705#true} is VALID [2020-07-08 21:48:12,770 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~nondet7; {705#true} is VALID [2020-07-08 21:48:12,771 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {705#true} is VALID [2020-07-08 21:48:12,771 INFO L263 TraceCheckUtils]: 10: Hoare triple {705#true} call #t~ret8 := isnan_double(~x~0); {705#true} is VALID [2020-07-08 21:48:12,771 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-08 21:48:12,771 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-08 21:48:12,772 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 21:48:12,772 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-08 21:48:12,772 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {705#true} is VALID [2020-07-08 21:48:12,772 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} assume 0 == #t~ret8; {705#true} is VALID [2020-07-08 21:48:12,773 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~ret8; {705#true} is VALID [2020-07-08 21:48:12,774 INFO L263 TraceCheckUtils]: 18: Hoare triple {705#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:12,774 INFO L280 TraceCheckUtils]: 19: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 21:48:12,775 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-08 21:48:12,776 INFO L263 TraceCheckUtils]: 21: Hoare triple {705#true} call #t~ret4 := __fpclassify_double(~x); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:12,776 INFO L280 TraceCheckUtils]: 22: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 21:48:12,776 INFO L280 TraceCheckUtils]: 23: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-08 21:48:12,777 INFO L280 TraceCheckUtils]: 24: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-08 21:48:12,777 INFO L280 TraceCheckUtils]: 25: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {705#true} is VALID [2020-07-08 21:48:12,777 INFO L280 TraceCheckUtils]: 26: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {705#true} is VALID [2020-07-08 21:48:12,777 INFO L280 TraceCheckUtils]: 27: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {705#true} is VALID [2020-07-08 21:48:12,778 INFO L280 TraceCheckUtils]: 28: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-08 21:48:12,778 INFO L280 TraceCheckUtils]: 29: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {705#true} is VALID [2020-07-08 21:48:12,778 INFO L280 TraceCheckUtils]: 30: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-08 21:48:12,778 INFO L280 TraceCheckUtils]: 31: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-08 21:48:12,779 INFO L280 TraceCheckUtils]: 32: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {705#true} is VALID [2020-07-08 21:48:12,779 INFO L280 TraceCheckUtils]: 33: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-08 21:48:12,779 INFO L280 TraceCheckUtils]: 34: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {705#true} is VALID [2020-07-08 21:48:12,780 INFO L280 TraceCheckUtils]: 35: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-08 21:48:12,780 INFO L280 TraceCheckUtils]: 36: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-08 21:48:12,780 INFO L280 TraceCheckUtils]: 37: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {705#true} is VALID [2020-07-08 21:48:12,780 INFO L280 TraceCheckUtils]: 38: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-08 21:48:12,781 INFO L280 TraceCheckUtils]: 39: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-08 21:48:12,781 INFO L280 TraceCheckUtils]: 40: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-08 21:48:12,782 INFO L280 TraceCheckUtils]: 41: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:12,782 INFO L280 TraceCheckUtils]: 42: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:12,783 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #125#return; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:12,784 INFO L280 TraceCheckUtils]: 44: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:12,785 INFO L280 TraceCheckUtils]: 45: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-08 21:48:12,785 INFO L280 TraceCheckUtils]: 46: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-08 21:48:12,785 INFO L280 TraceCheckUtils]: 47: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-08 21:48:12,785 INFO L280 TraceCheckUtils]: 48: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-08 21:48:12,786 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-08 21:48:12,786 INFO L280 TraceCheckUtils]: 50: Hoare triple {706#false} ~res~0 := #t~ret9; {706#false} is VALID [2020-07-08 21:48:12,786 INFO L280 TraceCheckUtils]: 51: Hoare triple {706#false} havoc #t~ret9; {706#false} is VALID [2020-07-08 21:48:12,786 INFO L280 TraceCheckUtils]: 52: Hoare triple {706#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {706#false} is VALID [2020-07-08 21:48:12,787 INFO L280 TraceCheckUtils]: 53: Hoare triple {706#false} assume !false; {706#false} is VALID [2020-07-08 21:48:12,790 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 21:48:12,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605313485] [2020-07-08 21:48:12,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:48:12,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 21:48:12,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17296306] [2020-07-08 21:48:12,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-08 21:48:12,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:48:12,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 21:48:12,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:12,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 21:48:12,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:48:12,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 21:48:12,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:48:12,855 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2020-07-08 21:48:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:13,448 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-07-08 21:48:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 21:48:13,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-08 21:48:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:48:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 21:48:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 21:48:13,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-08 21:48:13,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:13,587 INFO L225 Difference]: With dead ends: 88 [2020-07-08 21:48:13,587 INFO L226 Difference]: Without dead ends: 79 [2020-07-08 21:48:13,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:48:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-08 21:48:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2020-07-08 21:48:13,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:48:13,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 78 states. [2020-07-08 21:48:13,665 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 78 states. [2020-07-08 21:48:13,665 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 78 states. [2020-07-08 21:48:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:13,671 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-08 21:48:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-08 21:48:13,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:13,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:13,672 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 79 states. [2020-07-08 21:48:13,673 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 79 states. [2020-07-08 21:48:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:13,678 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-08 21:48:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-08 21:48:13,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:13,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:13,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:48:13,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:48:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-08 21:48:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-08 21:48:13,684 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 54 [2020-07-08 21:48:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:48:13,684 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-08 21:48:13,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 21:48:13,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-08 21:48:13,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-08 21:48:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 21:48:13,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:13,785 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, 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 21:48:13,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 21:48:13,785 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash 358345182, now seen corresponding path program 1 times [2020-07-08 21:48:13,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:13,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938150565] [2020-07-08 21:48:13,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:13,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1268#true} is VALID [2020-07-08 21:48:13,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-08 21:48:13,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-08 21:48:13,922 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 21:48:13,922 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1268#true} {1268#true} #121#return; {1268#true} is VALID [2020-07-08 21:48:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:13,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-08 21:48:13,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-08 21:48:13,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 21:48:13,927 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-08 21:48:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:14,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 21:48:14,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-08 21:48:14,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-08 21:48:14,026 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1268#true} is VALID [2020-07-08 21:48:14,027 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1268#true} is VALID [2020-07-08 21:48:14,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1268#true} is VALID [2020-07-08 21:48:14,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-08 21:48:14,027 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1268#true} is VALID [2020-07-08 21:48:14,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-08 21:48:14,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-08 21:48:14,028 INFO L280 TraceCheckUtils]: 10: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1268#true} is VALID [2020-07-08 21:48:14,028 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-08 21:48:14,029 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1268#true} is VALID [2020-07-08 21:48:14,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-08 21:48:14,029 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-08 21:48:14,029 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1268#true} is VALID [2020-07-08 21:48:14,030 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-08 21:48:14,030 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-08 21:48:14,030 INFO L280 TraceCheckUtils]: 18: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-08 21:48:14,031 INFO L280 TraceCheckUtils]: 19: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-08 21:48:14,031 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-08 21:48:14,031 INFO L280 TraceCheckUtils]: 21: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-08 21:48:14,032 INFO L280 TraceCheckUtils]: 22: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:14,033 INFO L280 TraceCheckUtils]: 23: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:14,034 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #125#return; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:14,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 21:48:14,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-08 21:48:14,036 INFO L263 TraceCheckUtils]: 2: Hoare triple {1268#true} call #t~ret4 := __fpclassify_double(~x); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:14,036 INFO L280 TraceCheckUtils]: 3: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 21:48:14,037 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-08 21:48:14,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-08 21:48:14,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1268#true} is VALID [2020-07-08 21:48:14,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1268#true} is VALID [2020-07-08 21:48:14,038 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1268#true} is VALID [2020-07-08 21:48:14,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-08 21:48:14,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1268#true} is VALID [2020-07-08 21:48:14,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-08 21:48:14,038 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-08 21:48:14,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1268#true} is VALID [2020-07-08 21:48:14,039 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-08 21:48:14,039 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1268#true} is VALID [2020-07-08 21:48:14,039 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-08 21:48:14,040 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-08 21:48:14,040 INFO L280 TraceCheckUtils]: 18: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1268#true} is VALID [2020-07-08 21:48:14,040 INFO L280 TraceCheckUtils]: 19: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-08 21:48:14,040 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-08 21:48:14,041 INFO L280 TraceCheckUtils]: 21: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-08 21:48:14,041 INFO L280 TraceCheckUtils]: 22: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-08 21:48:14,041 INFO L280 TraceCheckUtils]: 23: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-08 21:48:14,041 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-08 21:48:14,042 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:14,043 INFO L280 TraceCheckUtils]: 26: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:14,044 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #125#return; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:14,044 INFO L280 TraceCheckUtils]: 28: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:14,045 INFO L280 TraceCheckUtils]: 29: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-08 21:48:14,045 INFO L280 TraceCheckUtils]: 30: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-08 21:48:14,045 INFO L280 TraceCheckUtils]: 31: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-08 21:48:14,046 INFO L280 TraceCheckUtils]: 32: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-08 21:48:14,046 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-08 21:48:14,058 INFO L263 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 21:48:14,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1268#true} is VALID [2020-07-08 21:48:14,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-08 21:48:14,059 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-08 21:48:14,059 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 21:48:14,059 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1268#true} {1268#true} #121#return; {1268#true} is VALID [2020-07-08 21:48:14,060 INFO L263 TraceCheckUtils]: 6: Hoare triple {1268#true} call #t~ret10 := main(); {1268#true} is VALID [2020-07-08 21:48:14,060 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} ~x~0 := #t~nondet7; {1268#true} is VALID [2020-07-08 21:48:14,060 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~nondet7; {1268#true} is VALID [2020-07-08 21:48:14,060 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1268#true} is VALID [2020-07-08 21:48:14,061 INFO L263 TraceCheckUtils]: 10: Hoare triple {1268#true} call #t~ret8 := isnan_double(~x~0); {1268#true} is VALID [2020-07-08 21:48:14,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-08 21:48:14,061 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-08 21:48:14,061 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 21:48:14,062 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-08 21:48:14,062 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1268#true} is VALID [2020-07-08 21:48:14,062 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} assume 0 == #t~ret8; {1268#true} is VALID [2020-07-08 21:48:14,062 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~ret8; {1268#true} is VALID [2020-07-08 21:48:14,064 INFO L263 TraceCheckUtils]: 18: Hoare triple {1268#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:14,064 INFO L280 TraceCheckUtils]: 19: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 21:48:14,064 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-08 21:48:14,065 INFO L263 TraceCheckUtils]: 21: Hoare triple {1268#true} call #t~ret4 := __fpclassify_double(~x); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 21:48:14,065 INFO L280 TraceCheckUtils]: 22: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 21:48:14,066 INFO L280 TraceCheckUtils]: 23: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-08 21:48:14,066 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-08 21:48:14,066 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1268#true} is VALID [2020-07-08 21:48:14,066 INFO L280 TraceCheckUtils]: 26: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1268#true} is VALID [2020-07-08 21:48:14,066 INFO L280 TraceCheckUtils]: 27: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1268#true} is VALID [2020-07-08 21:48:14,067 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-08 21:48:14,067 INFO L280 TraceCheckUtils]: 29: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1268#true} is VALID [2020-07-08 21:48:14,067 INFO L280 TraceCheckUtils]: 30: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-08 21:48:14,067 INFO L280 TraceCheckUtils]: 31: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-08 21:48:14,068 INFO L280 TraceCheckUtils]: 32: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1268#true} is VALID [2020-07-08 21:48:14,068 INFO L280 TraceCheckUtils]: 33: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-08 21:48:14,068 INFO L280 TraceCheckUtils]: 34: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1268#true} is VALID [2020-07-08 21:48:14,068 INFO L280 TraceCheckUtils]: 35: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-08 21:48:14,068 INFO L280 TraceCheckUtils]: 36: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-08 21:48:14,069 INFO L280 TraceCheckUtils]: 37: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1268#true} is VALID [2020-07-08 21:48:14,069 INFO L280 TraceCheckUtils]: 38: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-08 21:48:14,069 INFO L280 TraceCheckUtils]: 39: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-08 21:48:14,069 INFO L280 TraceCheckUtils]: 40: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-08 21:48:14,070 INFO L280 TraceCheckUtils]: 41: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-08 21:48:14,070 INFO L280 TraceCheckUtils]: 42: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-08 21:48:14,070 INFO L280 TraceCheckUtils]: 43: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-08 21:48:14,071 INFO L280 TraceCheckUtils]: 44: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:14,071 INFO L280 TraceCheckUtils]: 45: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 21:48:14,072 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #125#return; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:14,073 INFO L280 TraceCheckUtils]: 47: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 21:48:14,073 INFO L280 TraceCheckUtils]: 48: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-08 21:48:14,074 INFO L280 TraceCheckUtils]: 49: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-08 21:48:14,074 INFO L280 TraceCheckUtils]: 50: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-08 21:48:14,074 INFO L280 TraceCheckUtils]: 51: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-08 21:48:14,074 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-08 21:48:14,075 INFO L280 TraceCheckUtils]: 53: Hoare triple {1269#false} ~res~0 := #t~ret9; {1269#false} is VALID [2020-07-08 21:48:14,075 INFO L280 TraceCheckUtils]: 54: Hoare triple {1269#false} havoc #t~ret9; {1269#false} is VALID [2020-07-08 21:48:14,075 INFO L280 TraceCheckUtils]: 55: Hoare triple {1269#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {1269#false} is VALID [2020-07-08 21:48:14,075 INFO L280 TraceCheckUtils]: 56: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-08 21:48:14,078 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 21:48:14,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938150565] [2020-07-08 21:48:14,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:48:14,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 21:48:14,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681372886] [2020-07-08 21:48:14,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-08 21:48:14,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:48:14,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 21:48:14,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:14,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 21:48:14,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:48:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 21:48:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:48:14,148 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2020-07-08 21:48:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:14,755 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-08 21:48:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 21:48:14,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-08 21:48:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:48:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 21:48:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 21:48:14,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-08 21:48:14,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:14,881 INFO L225 Difference]: With dead ends: 92 [2020-07-08 21:48:14,881 INFO L226 Difference]: Without dead ends: 83 [2020-07-08 21:48:14,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:48:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-08 21:48:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-07-08 21:48:14,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:48:14,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 78 states. [2020-07-08 21:48:14,967 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 78 states. [2020-07-08 21:48:14,967 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 78 states. [2020-07-08 21:48:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:14,977 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-08 21:48:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-08 21:48:14,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:14,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:14,978 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 83 states. [2020-07-08 21:48:14,978 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 83 states. [2020-07-08 21:48:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:14,984 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-08 21:48:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-08 21:48:14,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:14,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:14,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:48:14,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:48:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-08 21:48:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-08 21:48:14,989 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 57 [2020-07-08 21:48:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:48:14,990 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-08 21:48:14,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 21:48:14,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-08 21:48:15,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:48:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-08 21:48:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 21:48:15,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:15,105 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, 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 21:48:15,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 21:48:15,105 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1239578082, now seen corresponding path program 1 times [2020-07-08 21:48:15,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:15,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [203016575] [2020-07-08 21:48:15,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:48:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:48:15,299 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 21:48:15,300 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 21:48:15,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 21:48:15,373 WARN L170 areAnnotationChecker]: isnan_doubleENTRY has no Hoare annotation [2020-07-08 21:48:15,373 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 21:48:15,373 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: fmin_doubleENTRY has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 21:48:15,374 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: isnan_doubleFINAL has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 21:48:15,375 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 21:48:15,376 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 21:48:15,376 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-08 21:48:15,376 WARN L170 areAnnotationChecker]: isnan_doubleEXIT has no Hoare annotation [2020-07-08 21:48:15,376 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 21:48:15,376 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 21:48:15,376 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 21:48:15,376 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 21:48:15,377 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 21:48:15,378 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 21:48:15,379 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: L62-6 has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-08 21:48:15,380 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: fmin_doubleFINAL has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 21:48:15,381 WARN L170 areAnnotationChecker]: fmin_doubleEXIT has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-08 21:48:15,382 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-08 21:48:15,383 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-08 21:48:15,384 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-08 21:48:15,384 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-08 21:48:15,384 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-08 21:48:15,384 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-08 21:48:15,384 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-08 21:48:15,384 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-08 21:48:15,384 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-08 21:48:15,385 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 21:48:15,385 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-08 21:48:15,385 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 21:48:15,385 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 21:48:15,385 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 21:48:15,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 09:48:15 BoogieIcfgContainer [2020-07-08 21:48:15,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 21:48:15,403 INFO L168 Benchmark]: Toolchain (without parser) took 5592.42 ms. Allocated memory was 144.7 MB in the beginning and 286.3 MB in the end (delta: 141.6 MB). Free memory was 102.5 MB in the beginning and 217.6 MB in the end (delta: -115.1 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:15,405 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-08 21:48:15,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.05 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 181.2 MB in the end (delta: -78.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:15,409 INFO L168 Benchmark]: Boogie Preprocessor took 52.49 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 178.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:15,409 INFO L168 Benchmark]: RCFGBuilder took 542.06 ms. Allocated memory is still 202.4 MB. Free memory was 178.7 MB in the beginning and 143.3 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:15,415 INFO L168 Benchmark]: TraceAbstraction took 4635.81 ms. Allocated memory was 202.4 MB in the beginning and 286.3 MB in the end (delta: 83.9 MB). Free memory was 143.3 MB in the beginning and 217.6 MB in the end (delta: -74.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:15,423 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.05 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 181.2 MB in the end (delta: -78.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.49 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 178.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 542.06 ms. Allocated memory is still 202.4 MB. Free memory was 178.7 MB in the beginning and 143.3 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4635.81 ms. Allocated memory was 202.4 MB in the beginning and 286.3 MB in the end (delta: 83.9 MB). Free memory was 143.3 MB in the beginning and 217.6 MB in the end (delta: -74.3 MB). Peak memory consumption was 9.6 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(); VAL [__VERIFIER_nondet_double()=2147483651, x=2147483651] [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) VAL [isnan_double(x)=0, x=2147483651] [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; VAL [\old(x)=2147483651, ew_u={2:0}, x=2147483651] [L22] ew_u.value = (x) VAL [\old(x)=2147483651, ew_u={2:0}, x=2147483651] [L23] EXPR ew_u.parts.msw VAL [\old(x)=2147483651, ew_u={2:0}, ew_u.parts.msw=2147483647, x=2147483651] [L23] (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=2147483654, \old(x)=2147483651, ew_u={2:0}, ew_u.parts.msw=2147483647, msw=2147483647, x=2147483651] [L24] EXPR ew_u.parts.lsw VAL [\old(x)=2147483651, ew_u={2:0}, ew_u.parts.lsw=3, msw=2147483647, x=2147483651] [L24] (lsw) = ew_u.parts.lsw VAL [\old(x)=2147483651, ew_u={2:0}, ew_u.parts.lsw=3, lsw=3, msw=2147483647, x=2147483651] [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=2147483651, lsw=3, msw=2147483647, x=2147483651] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=2147483651, lsw=3, msw=2147483647, x=2147483651] [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=2147483651, lsw=3, msw=2147483647, x=2147483651] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) VAL [\old(x)=2147483651, lsw=3, msw=2147483647, x=2147483651] [L41] return 0; VAL [\old(x)=2147483651, \result=0, lsw=3, 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 VAL [\old(x)=2147483651, \old(y)=2147483650, __fpclassify_double(x)=0, x=2147483651, y=2147483650] [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); VAL [fmin_double(x, y)=2147483650, res=2147483650, x=2147483651, y=2147483650] [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, 81 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.4s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 97 SDslu, 395 SDs, 0 SdLazy, 325 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred 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.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 13222 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...