/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_1251b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:39:08,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:39:08,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:39:08,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:39:08,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:39:08,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:39:08,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:39:08,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:39:08,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:39:08,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:39:08,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:39:08,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:39:08,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:39:08,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:39:08,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:39:08,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:39:08,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:39:08,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:39:08,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:39:08,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:39:08,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:39:08,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:39:08,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:39:08,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:39:08,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:39:08,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:39:08,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:39:08,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:39:08,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:39:08,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:39:08,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:39:08,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:39:08,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:39:08,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:39:08,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:39:08,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:39:08,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:39:08,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:39:08,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:39:08,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:39:08,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:39:08,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:39:08,379 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:39:08,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:39:08,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:39:08,384 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:39:08,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:39:08,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:39:08,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:39:08,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:39:08,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:39:08,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:39:08,385 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:39:08,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:39:08,386 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:39:08,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:39:08,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:39:08,386 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:39:08,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:39:08,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:39:08,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:39:08,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:39:08,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:39:08,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:39:08,388 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-18 04:39:08,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:39:08,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:39:08,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:39:08,688 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:39:08,688 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:39:08,689 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-07-18 04:39:08,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730072de3/e4c7461baa5544b2b4380a8347f3b677/FLAGeb8dc4a94 [2020-07-18 04:39:09,249 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:39:09,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-07-18 04:39:09,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730072de3/e4c7461baa5544b2b4380a8347f3b677/FLAGeb8dc4a94 [2020-07-18 04:39:09,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730072de3/e4c7461baa5544b2b4380a8347f3b677 [2020-07-18 04:39:09,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:39:09,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:39:09,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:39:09,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:39:09,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:39:09,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ab632c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09, skipping insertion in model container [2020-07-18 04:39:09,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:39:09,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:39:09,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:39:09,812 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:39:09,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:39:09,954 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:39:09,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09 WrapperNode [2020-07-18 04:39:09,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:39:09,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:39:09,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:39:09,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:39:09,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:09,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (1/1) ... [2020-07-18 04:39:10,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:39:10,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:39:10,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:39:10,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:39:10,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (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-18 04:39:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:39:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:39:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-18 04:39:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-18 04:39:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-18 04:39:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-18 04:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-18 04:39:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-18 04:39:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 04:39:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 04:39:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 04:39:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 04:39:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-18 04:39:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:39:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:39:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:39:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 04:39:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 04:39:10,548 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:39:10,548 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 04:39:10,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:39:10 BoogieIcfgContainer [2020-07-18 04:39:10,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:39:10,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:39:10,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:39:10,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:39:10,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:39:09" (1/3) ... [2020-07-18 04:39:10,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f454a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:39:10, skipping insertion in model container [2020-07-18 04:39:10,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:09" (2/3) ... [2020-07-18 04:39:10,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f454a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:39:10, skipping insertion in model container [2020-07-18 04:39:10,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:39:10" (3/3) ... [2020-07-18 04:39:10,561 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-07-18 04:39:10,571 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:39:10,579 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:39:10,593 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:39:10,612 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:39:10,612 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:39:10,612 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:39:10,612 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:39:10,613 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:39:10,613 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:39:10,613 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:39:10,613 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:39:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-18 04:39:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 04:39:10,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:10,639 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-18 04:39:10,640 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1770687738, now seen corresponding path program 1 times [2020-07-18 04:39:10,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:10,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907298626] [2020-07-18 04:39:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:10,892 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-18 04:39:10,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-18 04:39:10,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-18 04:39:10,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 04:39:10,894 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {84#true} {84#true} #125#return; {84#true} is VALID [2020-07-18 04:39:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:10,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-18 04:39:10,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-18 04:39:10,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 04:39:10,906 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-18 04:39:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:10,954 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-18 04:39:10,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-18 04:39:10,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-18 04:39:10,956 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-18 04:39:10,956 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-18 04:39:10,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-18 04:39:10,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-18 04:39:10,958 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {85#false} {84#true} #121#return; {85#false} is VALID [2020-07-18 04:39:10,958 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-18 04:39:10,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-18 04:39:10,962 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-18 04:39:10,962 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-18 04:39:10,962 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-18 04:39:10,963 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-18 04:39:10,964 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-18 04:39:10,964 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-18 04:39:10,965 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-18 04:39:10,965 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-18 04:39:10,965 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {85#false} {84#true} #121#return; {85#false} is VALID [2020-07-18 04:39:10,966 INFO L280 TraceCheckUtils]: 11: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-18 04:39:10,966 INFO L280 TraceCheckUtils]: 12: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-18 04:39:10,967 INFO L280 TraceCheckUtils]: 13: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-18 04:39:10,967 INFO L280 TraceCheckUtils]: 14: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-18 04:39:10,967 INFO L280 TraceCheckUtils]: 15: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-18 04:39:10,968 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-18 04:39:10,971 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-18 04:39:10,971 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-18 04:39:10,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-18 04:39:10,972 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-18 04:39:10,972 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 04:39:10,973 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #125#return; {84#true} is VALID [2020-07-18 04:39:10,973 INFO L263 TraceCheckUtils]: 6: Hoare triple {84#true} call #t~ret10 := main(); {84#true} is VALID [2020-07-18 04:39:10,973 INFO L280 TraceCheckUtils]: 7: Hoare triple {84#true} ~x~0 := #t~nondet7; {84#true} is VALID [2020-07-18 04:39:10,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} havoc #t~nondet7; {84#true} is VALID [2020-07-18 04:39:10,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {84#true} is VALID [2020-07-18 04:39:10,974 INFO L263 TraceCheckUtils]: 10: Hoare triple {84#true} call #t~ret8 := isnan_double(~x~0); {84#true} is VALID [2020-07-18 04:39:10,975 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-18 04:39:10,975 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-18 04:39:10,975 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-18 04:39:10,976 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-18 04:39:10,976 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {84#true} is VALID [2020-07-18 04:39:10,976 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#true} assume 0 == #t~ret8; {84#true} is VALID [2020-07-18 04:39:10,977 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc #t~ret8; {84#true} is VALID [2020-07-18 04:39:10,979 INFO L263 TraceCheckUtils]: 18: Hoare triple {84#true} call #t~ret9 := fmax_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-18 04:39:10,979 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-18 04:39:10,979 INFO L280 TraceCheckUtils]: 20: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-18 04:39:10,982 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-18 04:39:10,982 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-18 04:39:10,982 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-18 04:39:10,983 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-18 04:39:10,983 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-18 04:39:10,983 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-18 04:39:10,984 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-18 04:39:10,984 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-18 04:39:10,984 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {85#false} {84#true} #121#return; {85#false} is VALID [2020-07-18 04:39:10,985 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-18 04:39:10,985 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-18 04:39:10,985 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-18 04:39:10,985 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-18 04:39:10,986 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-18 04:39:10,986 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-18 04:39:10,986 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} ~res~0 := #t~ret9; {85#false} is VALID [2020-07-18 04:39:10,987 INFO L280 TraceCheckUtils]: 37: Hoare triple {85#false} havoc #t~ret9; {85#false} is VALID [2020-07-18 04:39:10,987 INFO L280 TraceCheckUtils]: 38: Hoare triple {85#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {85#false} is VALID [2020-07-18 04:39:10,987 INFO L280 TraceCheckUtils]: 39: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-18 04:39:10,991 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-18 04:39:10,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907298626] [2020-07-18 04:39:10,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:39:10,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 04:39:10,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230110035] [2020-07-18 04:39:11,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-18 04:39:11,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:39:11,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 04:39:11,080 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-18 04:39:11,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 04:39:11,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:39:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 04:39:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 04:39:11,093 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2020-07-18 04:39:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:11,739 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2020-07-18 04:39:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 04:39:11,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-18 04:39:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:39:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 04:39:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-18 04:39:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 04:39:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-18 04:39:11,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-18 04:39:11,990 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-18 04:39:12,023 INFO L225 Difference]: With dead ends: 141 [2020-07-18 04:39:12,024 INFO L226 Difference]: Without dead ends: 74 [2020-07-18 04:39:12,031 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-18 04:39:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-18 04:39:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-18 04:39:12,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:39:12,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-18 04:39:12,193 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-18 04:39:12,193 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-18 04:39:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:12,205 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-18 04:39:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-18 04:39:12,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:12,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:12,208 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-18 04:39:12,208 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-18 04:39:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:12,228 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-18 04:39:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-18 04:39:12,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:12,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:12,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:39:12,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:39:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-18 04:39:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2020-07-18 04:39:12,244 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 40 [2020-07-18 04:39:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:39:12,244 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2020-07-18 04:39:12,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 04:39:12,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2020-07-18 04:39:12,345 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-18 04:39:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-18 04:39:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 04:39:12,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:12,348 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-18 04:39:12,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:39:12,348 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:12,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:12,349 INFO L82 PathProgramCache]: Analyzing trace with hash 524719120, now seen corresponding path program 1 times [2020-07-18 04:39:12,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:12,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111847282] [2020-07-18 04:39:12,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,437 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-18 04:39:12,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-18 04:39:12,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-18 04:39:12,438 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-18 04:39:12,438 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {705#true} {705#true} #125#return; {705#true} is VALID [2020-07-18 04:39:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-18 04:39:12,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-18 04:39:12,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-18 04:39:12,444 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-18 04:39:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:12,557 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-18 04:39:12,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-18 04:39:12,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-18 04:39:12,559 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {705#true} is VALID [2020-07-18 04:39:12,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {705#true} is VALID [2020-07-18 04:39:12,559 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: L31 {705#true} is VALID [2020-07-18 04:39:12,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-18 04:39:12,560 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: L32-1 {705#true} is VALID [2020-07-18 04:39:12,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-18 04:39:12,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-18 04:39:12,561 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: L33 {705#true} is VALID [2020-07-18 04:39:12,561 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-18 04:39:12,561 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: L33-2 {705#true} is VALID [2020-07-18 04:39:12,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-18 04:39:12,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-18 04:39:12,562 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {705#true} is VALID [2020-07-18 04:39:12,563 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-18 04:39:12,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-18 04:39:12,563 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-18 04:39:12,564 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:12,565 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:12,566 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #121#return; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:12,567 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-18 04:39:12,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-18 04:39:12,569 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-18 04:39:12,569 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-18 04:39:12,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-18 04:39:12,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-18 04:39:12,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {705#true} is VALID [2020-07-18 04:39:12,570 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {705#true} is VALID [2020-07-18 04:39:12,570 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: L31 {705#true} is VALID [2020-07-18 04:39:12,571 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-18 04:39:12,571 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: L32-1 {705#true} is VALID [2020-07-18 04:39:12,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-18 04:39:12,572 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-18 04:39:12,572 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: L33 {705#true} is VALID [2020-07-18 04:39:12,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-18 04:39:12,572 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: L33-2 {705#true} is VALID [2020-07-18 04:39:12,573 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-18 04:39:12,573 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-18 04:39:12,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {705#true} is VALID [2020-07-18 04:39:12,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-18 04:39:12,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-18 04:39:12,574 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-18 04:39:12,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:12,576 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:12,577 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #121#return; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:12,577 INFO L280 TraceCheckUtils]: 25: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:12,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-18 04:39:12,578 INFO L280 TraceCheckUtils]: 27: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-18 04:39:12,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-18 04:39:12,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-18 04:39:12,579 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-18 04:39:12,582 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-18 04:39:12,582 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-18 04:39:12,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-18 04:39:12,582 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-18 04:39:12,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-18 04:39:12,583 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {705#true} {705#true} #125#return; {705#true} is VALID [2020-07-18 04:39:12,583 INFO L263 TraceCheckUtils]: 6: Hoare triple {705#true} call #t~ret10 := main(); {705#true} is VALID [2020-07-18 04:39:12,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} ~x~0 := #t~nondet7; {705#true} is VALID [2020-07-18 04:39:12,584 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~nondet7; {705#true} is VALID [2020-07-18 04:39:12,584 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {705#true} is VALID [2020-07-18 04:39:12,584 INFO L263 TraceCheckUtils]: 10: Hoare triple {705#true} call #t~ret8 := isnan_double(~x~0); {705#true} is VALID [2020-07-18 04:39:12,585 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-18 04:39:12,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-18 04:39:12,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-18 04:39:12,585 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-18 04:39:12,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {705#true} is VALID [2020-07-18 04:39:12,586 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} assume 0 == #t~ret8; {705#true} is VALID [2020-07-18 04:39:12,586 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~ret8; {705#true} is VALID [2020-07-18 04:39:12,588 INFO L263 TraceCheckUtils]: 18: Hoare triple {705#true} call #t~ret9 := fmax_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-18 04:39:12,588 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-18 04:39:12,588 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-18 04:39:12,589 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-18 04:39:12,590 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-18 04:39:12,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-18 04:39:12,590 INFO L280 TraceCheckUtils]: 24: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-18 04:39:12,590 INFO L280 TraceCheckUtils]: 25: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {705#true} is VALID [2020-07-18 04:39:12,591 INFO L280 TraceCheckUtils]: 26: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {705#true} is VALID [2020-07-18 04:39:12,591 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: L31 {705#true} is VALID [2020-07-18 04:39:12,591 INFO L280 TraceCheckUtils]: 28: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-18 04:39:12,591 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: L32-1 {705#true} is VALID [2020-07-18 04:39:12,592 INFO L280 TraceCheckUtils]: 30: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-18 04:39:12,592 INFO L280 TraceCheckUtils]: 31: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-18 04:39:12,592 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: L33 {705#true} is VALID [2020-07-18 04:39:12,592 INFO L280 TraceCheckUtils]: 33: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-18 04:39:12,593 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: L33-2 {705#true} is VALID [2020-07-18 04:39:12,593 INFO L280 TraceCheckUtils]: 35: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-18 04:39:12,593 INFO L280 TraceCheckUtils]: 36: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-18 04:39:12,593 INFO L280 TraceCheckUtils]: 37: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {705#true} is VALID [2020-07-18 04:39:12,594 INFO L280 TraceCheckUtils]: 38: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-18 04:39:12,594 INFO L280 TraceCheckUtils]: 39: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-18 04:39:12,594 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-18 04:39:12,595 INFO L280 TraceCheckUtils]: 41: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:12,596 INFO L280 TraceCheckUtils]: 42: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:12,597 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #121#return; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:12,597 INFO L280 TraceCheckUtils]: 44: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-18 04:39:12,598 INFO L280 TraceCheckUtils]: 45: Hoare triple {771#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-18 04:39:12,598 INFO L280 TraceCheckUtils]: 46: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-18 04:39:12,599 INFO L280 TraceCheckUtils]: 47: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-18 04:39:12,599 INFO L280 TraceCheckUtils]: 48: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-18 04:39:12,599 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-18 04:39:12,599 INFO L280 TraceCheckUtils]: 50: Hoare triple {706#false} ~res~0 := #t~ret9; {706#false} is VALID [2020-07-18 04:39:12,600 INFO L280 TraceCheckUtils]: 51: Hoare triple {706#false} havoc #t~ret9; {706#false} is VALID [2020-07-18 04:39:12,600 INFO L280 TraceCheckUtils]: 52: Hoare triple {706#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {706#false} is VALID [2020-07-18 04:39:12,600 INFO L280 TraceCheckUtils]: 53: Hoare triple {706#false} assume !false; {706#false} is VALID [2020-07-18 04:39:12,603 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-18 04:39:12,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111847282] [2020-07-18 04:39:12,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:39:12,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 04:39:12,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055912798] [2020-07-18 04:39:12,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-18 04:39:12,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:39:12,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:39:12,662 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-18 04:39:12,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:39:12,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:39:12,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:39:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:39:12,663 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2020-07-18 04:39:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:13,316 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-07-18 04:39:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:39:13,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-18 04:39:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:39:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-18 04:39:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-18 04:39:13,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-18 04:39:13,449 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-18 04:39:13,453 INFO L225 Difference]: With dead ends: 88 [2020-07-18 04:39:13,454 INFO L226 Difference]: Without dead ends: 79 [2020-07-18 04:39:13,455 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-18 04:39:13,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-18 04:39:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2020-07-18 04:39:13,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:39:13,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 78 states. [2020-07-18 04:39:13,534 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 78 states. [2020-07-18 04:39:13,534 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 78 states. [2020-07-18 04:39:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:13,540 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-18 04:39:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-18 04:39:13,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:13,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:13,542 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 79 states. [2020-07-18 04:39:13,542 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 79 states. [2020-07-18 04:39:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:13,547 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-18 04:39:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-18 04:39:13,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:13,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:13,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:39:13,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:39:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-18 04:39:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-18 04:39:13,554 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 54 [2020-07-18 04:39:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:39:13,554 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-18 04:39:13,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:39:13,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-18 04:39:13,663 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-18 04:39:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-18 04:39:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 04:39:13,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:13,666 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-18 04:39:13,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:39:13,667 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2023591653, now seen corresponding path program 1 times [2020-07-18 04:39:13,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:13,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1752990080] [2020-07-18 04:39:13,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:13,766 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-18 04:39:13,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-18 04:39:13,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-18 04:39:13,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-18 04:39:13,768 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1268#true} {1268#true} #125#return; {1268#true} is VALID [2020-07-18 04:39:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:13,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-18 04:39:13,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-18 04:39:13,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-18 04:39:13,773 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-18 04:39:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:13,884 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-18 04:39:13,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-18 04:39:13,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-18 04:39:13,885 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1268#true} is VALID [2020-07-18 04:39:13,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1268#true} is VALID [2020-07-18 04:39:13,886 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: L31 {1268#true} is VALID [2020-07-18 04:39:13,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-18 04:39:13,886 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: L32-1 {1268#true} is VALID [2020-07-18 04:39:13,886 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-18 04:39:13,887 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-18 04:39:13,887 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: L33 {1268#true} is VALID [2020-07-18 04:39:13,887 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-18 04:39:13,887 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: L33-2 {1268#true} is VALID [2020-07-18 04:39:13,888 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-18 04:39:13,888 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-18 04:39:13,888 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1268#true} is VALID [2020-07-18 04:39:13,889 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-18 04:39:13,889 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-18 04:39:13,889 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-18 04:39:13,889 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-18 04:39:13,890 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-18 04:39:13,890 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-18 04:39:13,891 INFO L280 TraceCheckUtils]: 22: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:13,892 INFO L280 TraceCheckUtils]: 23: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:13,893 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #121#return; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:13,894 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-18 04:39:13,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-18 04:39:13,895 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-18 04:39:13,895 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-18 04:39:13,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-18 04:39:13,896 INFO L280 TraceCheckUtils]: 5: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-18 04:39:13,896 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1268#true} is VALID [2020-07-18 04:39:13,896 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1268#true} is VALID [2020-07-18 04:39:13,897 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: L31 {1268#true} is VALID [2020-07-18 04:39:13,897 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-18 04:39:13,897 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: L32-1 {1268#true} is VALID [2020-07-18 04:39:13,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-18 04:39:13,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-18 04:39:13,898 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: L33 {1268#true} is VALID [2020-07-18 04:39:13,898 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-18 04:39:13,898 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: L33-2 {1268#true} is VALID [2020-07-18 04:39:13,899 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-18 04:39:13,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-18 04:39:13,899 INFO L280 TraceCheckUtils]: 18: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1268#true} is VALID [2020-07-18 04:39:13,900 INFO L280 TraceCheckUtils]: 19: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-18 04:39:13,900 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-18 04:39:13,900 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-18 04:39:13,900 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-18 04:39:13,900 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-18 04:39:13,901 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-18 04:39:13,901 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:13,902 INFO L280 TraceCheckUtils]: 26: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:13,903 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #121#return; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:13,904 INFO L280 TraceCheckUtils]: 28: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:13,904 INFO L280 TraceCheckUtils]: 29: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-18 04:39:13,904 INFO L280 TraceCheckUtils]: 30: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-18 04:39:13,905 INFO L280 TraceCheckUtils]: 31: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-18 04:39:13,905 INFO L280 TraceCheckUtils]: 32: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-18 04:39:13,905 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-18 04:39:13,907 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-18 04:39:13,907 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-18 04:39:13,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-18 04:39:13,908 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-18 04:39:13,908 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-18 04:39:13,908 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1268#true} {1268#true} #125#return; {1268#true} is VALID [2020-07-18 04:39:13,908 INFO L263 TraceCheckUtils]: 6: Hoare triple {1268#true} call #t~ret10 := main(); {1268#true} is VALID [2020-07-18 04:39:13,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} ~x~0 := #t~nondet7; {1268#true} is VALID [2020-07-18 04:39:13,909 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~nondet7; {1268#true} is VALID [2020-07-18 04:39:13,909 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1268#true} is VALID [2020-07-18 04:39:13,909 INFO L263 TraceCheckUtils]: 10: Hoare triple {1268#true} call #t~ret8 := isnan_double(~x~0); {1268#true} is VALID [2020-07-18 04:39:13,910 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-18 04:39:13,910 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-18 04:39:13,910 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-18 04:39:13,910 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-18 04:39:13,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1268#true} is VALID [2020-07-18 04:39:13,911 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} assume 0 == #t~ret8; {1268#true} is VALID [2020-07-18 04:39:13,911 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~ret8; {1268#true} is VALID [2020-07-18 04:39:13,912 INFO L263 TraceCheckUtils]: 18: Hoare triple {1268#true} call #t~ret9 := fmax_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-18 04:39:13,912 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-18 04:39:13,913 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-18 04:39:13,914 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-18 04:39:13,914 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-18 04:39:13,914 INFO L280 TraceCheckUtils]: 23: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-18 04:39:13,914 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-18 04:39:13,915 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L29-2 {1268#true} is VALID [2020-07-18 04:39:13,915 INFO L280 TraceCheckUtils]: 26: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30 {1268#true} is VALID [2020-07-18 04:39:13,915 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: L31 {1268#true} is VALID [2020-07-18 04:39:13,915 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-18 04:39:13,916 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: L32-1 {1268#true} is VALID [2020-07-18 04:39:13,916 INFO L280 TraceCheckUtils]: 30: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-18 04:39:13,916 INFO L280 TraceCheckUtils]: 31: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-18 04:39:13,916 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: L33 {1268#true} is VALID [2020-07-18 04:39:13,916 INFO L280 TraceCheckUtils]: 33: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-18 04:39:13,917 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: L33-2 {1268#true} is VALID [2020-07-18 04:39:13,917 INFO L280 TraceCheckUtils]: 35: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-18 04:39:13,917 INFO L280 TraceCheckUtils]: 36: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-18 04:39:13,917 INFO L280 TraceCheckUtils]: 37: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L30-1 {1268#true} is VALID [2020-07-18 04:39:13,918 INFO L280 TraceCheckUtils]: 38: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-18 04:39:13,918 INFO L280 TraceCheckUtils]: 39: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-18 04:39:13,918 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-18 04:39:13,918 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-18 04:39:13,918 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-18 04:39:13,919 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-18 04:39:13,919 INFO L280 TraceCheckUtils]: 44: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:13,920 INFO L280 TraceCheckUtils]: 45: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-18 04:39:13,921 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #121#return; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:13,921 INFO L280 TraceCheckUtils]: 47: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-18 04:39:13,922 INFO L280 TraceCheckUtils]: 48: Hoare triple {1340#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-18 04:39:13,922 INFO L280 TraceCheckUtils]: 49: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-18 04:39:13,923 INFO L280 TraceCheckUtils]: 50: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-18 04:39:13,923 INFO L280 TraceCheckUtils]: 51: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-18 04:39:13,923 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-18 04:39:13,923 INFO L280 TraceCheckUtils]: 53: Hoare triple {1269#false} ~res~0 := #t~ret9; {1269#false} is VALID [2020-07-18 04:39:13,924 INFO L280 TraceCheckUtils]: 54: Hoare triple {1269#false} havoc #t~ret9; {1269#false} is VALID [2020-07-18 04:39:13,924 INFO L280 TraceCheckUtils]: 55: Hoare triple {1269#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {1269#false} is VALID [2020-07-18 04:39:13,924 INFO L280 TraceCheckUtils]: 56: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-18 04:39:13,927 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-18 04:39:13,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1752990080] [2020-07-18 04:39:13,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:39:13,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 04:39:13,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826540160] [2020-07-18 04:39:13,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-18 04:39:13,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:39:13,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:39:13,989 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-18 04:39:13,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:39:13,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:39:13,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:39:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:39:13,991 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2020-07-18 04:39:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:14,629 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-18 04:39:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:39:14,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-18 04:39:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:39:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-18 04:39:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:39:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-18 04:39:14,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-18 04:39:14,771 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-18 04:39:14,775 INFO L225 Difference]: With dead ends: 92 [2020-07-18 04:39:14,775 INFO L226 Difference]: Without dead ends: 83 [2020-07-18 04:39:14,776 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-18 04:39:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-18 04:39:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-07-18 04:39:14,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:39:14,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 78 states. [2020-07-18 04:39:14,852 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 78 states. [2020-07-18 04:39:14,853 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 78 states. [2020-07-18 04:39:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:14,858 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-18 04:39:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-18 04:39:14,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:14,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:14,859 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 83 states. [2020-07-18 04:39:14,859 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 83 states. [2020-07-18 04:39:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:39:14,864 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-18 04:39:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-18 04:39:14,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:39:14,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:39:14,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:39:14,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:39:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-18 04:39:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-18 04:39:14,870 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 57 [2020-07-18 04:39:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:39:14,870 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-18 04:39:14,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:39:14,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-18 04:39:14,956 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-18 04:39:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-18 04:39:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 04:39:14,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:14,959 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-18 04:39:14,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:39:14,959 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash 425668389, now seen corresponding path program 1 times [2020-07-18 04:39:14,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:14,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [493157341] [2020-07-18 04:39:14,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:39:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:39:15,118 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 04:39:15,119 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 04:39:15,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:39:15,185 WARN L170 areAnnotationChecker]: isnan_doubleENTRY has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: __fpclassify_doubleENTRY has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: fmax_doubleENTRY has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:39:15,186 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: isnan_doubleFINAL has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-18 04:39:15,187 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-18 04:39:15,188 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-18 04:39:15,188 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 04:39:15,188 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-18 04:39:15,188 WARN L170 areAnnotationChecker]: isnan_doubleEXIT has no Hoare annotation [2020-07-18 04:39:15,188 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 04:39:15,188 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-18 04:39:15,188 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-18 04:39:15,189 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-18 04:39:15,190 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L72-5 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-18 04:39:15,191 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: L72-6 has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-18 04:39:15,192 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: fmax_doubleFINAL has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-18 04:39:15,193 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: fmax_doubleEXIT has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-18 04:39:15,194 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-18 04:39:15,195 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L60-5 has no Hoare annotation [2020-07-18 04:39:15,196 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-18 04:39:15,197 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-18 04:39:15,197 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-18 04:39:15,197 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-18 04:39:15,197 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-18 04:39:15,197 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-18 04:39:15,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:39:15 BoogieIcfgContainer [2020-07-18 04:39:15,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:39:15,213 INFO L168 Benchmark]: Toolchain (without parser) took 5603.74 ms. Allocated memory was 145.8 MB in the beginning and 277.9 MB in the end (delta: 132.1 MB). Free memory was 103.4 MB in the beginning and 170.6 MB in the end (delta: -67.2 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:15,214 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 04:39:15,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.71 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 103.0 MB in the beginning and 182.3 MB in the end (delta: -79.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:15,215 INFO L168 Benchmark]: Boogie Preprocessor took 47.26 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 179.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:15,217 INFO L168 Benchmark]: RCFGBuilder took 550.34 ms. Allocated memory is still 203.4 MB. Free memory was 179.1 MB in the beginning and 144.0 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:15,224 INFO L168 Benchmark]: TraceAbstraction took 4649.86 ms. Allocated memory was 203.4 MB in the beginning and 277.9 MB in the end (delta: 74.4 MB). Free memory was 144.0 MB in the beginning and 170.6 MB in the end (delta: -26.6 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:39:15,229 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.71 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 103.0 MB in the beginning and 182.3 MB in the end (delta: -79.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.26 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 179.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 550.34 ms. Allocated memory is still 203.4 MB. Free memory was 179.1 MB in the beginning and 144.0 MB in the end (delta: 35.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4649.86 ms. Allocated memory was 203.4 MB in the beginning and 277.9 MB in the end (delta: 74.4 MB). Free memory was 144.0 MB in the beginning and 170.6 MB in the end (delta: -26.6 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); VAL [__VERIFIER_nondet_double()=2146435077, x=2146435077] [L65] double y = 0.0 / 0.0; VAL [x=2146435077] [L72] CALL, EXPR isnan_double(x) VAL [\old(x)=2146435077] [L16] return x != x; VAL [\old(x)=2146435077, \result=0, x=2146435077] [L72] RET, EXPR isnan_double(x) VAL [isnan_double(x)=0, x=2146435077] [L72] COND TRUE !isnan_double(x) VAL [isnan_double(x)=0, x=2146435077] [L74] CALL, EXPR fmax_double(x, y) VAL [\old(x)=2146435077, \old(y)=2146435076] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=2146435077] [L27] __uint32_t msw, lsw; VAL [\old(x)=2146435077, x=2146435077] [L30] ieee_double_shape_type ew_u; VAL [\old(x)=2146435077, ew_u={2:0}, x=2146435077] [L31] ew_u.value = (x) VAL [\old(x)=2146435077, ew_u={2:0}, x=2146435077] [L32] EXPR ew_u.parts.msw VAL [\old(x)=2146435077, ew_u={2:0}, ew_u.parts.msw=2146435073, x=2146435077] [L32] (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=2146435080, \old(x)=2146435077, ew_u={2:0}, ew_u.parts.msw=2146435073, msw=2146435073, x=2146435077] [L33] EXPR ew_u.parts.lsw VAL [\old(x)=2146435077, ew_u={2:0}, ew_u.parts.lsw=3, msw=2146435073, x=2146435077] [L33] (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=2146435074, \old(x)=2146435077, ew_u={2:0}, ew_u.parts.lsw=3, lsw=3, msw=2146435073, x=2146435077] [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=2146435077, lsw=3, msw=2146435073, x=2146435077] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=2146435077, lsw=3, msw=2146435073, x=2146435077] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=2146435077, lsw=3, msw=2146435073, x=2146435077] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) VAL [\old(x)=2146435077, lsw=3, msw=2146435073, x=2146435077] [L50] return 0; VAL [\old(x)=2146435077, \result=0, lsw=3, msw=2146435073, x=2146435077] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=2146435077, \old(y)=2146435076, __fpclassify_double(x)=0, x=2146435077, y=2146435076] [L55] COND TRUE __fpclassify_double(x) == 0 VAL [\old(x)=2146435077, \old(y)=2146435076, __fpclassify_double(x)=0, x=2146435077, y=2146435076] [L56] return y; VAL [\old(x)=2146435077, \old(y)=2146435076, \result=2146435076, x=2146435077, y=2146435076] [L74] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=2146435076, x=2146435077, y=2146435076] [L74] double res = fmax_double(x, y); VAL [fmax_double(x, y)=2146435076, res=2146435076, x=2146435077, y=2146435076] [L77] COND TRUE res != x VAL [res=2146435076, x=2146435077, y=2146435076] [L78] __VERIFIER_error() VAL [res=2146435076, x=2146435077, y=2146435076] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.5s, 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.2s 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.6s 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...