/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1232b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:21,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:21,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:21,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:21,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:21,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:21,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:21,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:21,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:21,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:21,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:21,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:21,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:21,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:21,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:21,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:21,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:21,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:21,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:21,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:21,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:21,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:21,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:21,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:21,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:21,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:21,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:21,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:21,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:21,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:21,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:21,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:21,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:21,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:21,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:21,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:21,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:21,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:21,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:21,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:21,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:21,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:42:21,989 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:21,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:21,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:21,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:21,994 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:21,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:21,995 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:21,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:21,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:21,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:21,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:21,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:21,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:21,996 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:21,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:21,996 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:21,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:21,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:21,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:21,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:21,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:21,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:21,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:21,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:21,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:21,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:21,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:21,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:21,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:21,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:22,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:22,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:22,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:22,381 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:22,381 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:22,383 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1232b.c [2020-07-10 14:42:22,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc32375c5/d994bed3db0c47159cecc28921c81f46/FLAG8699dd59f [2020-07-10 14:42:22,911 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:22,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1232b.c [2020-07-10 14:42:22,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc32375c5/d994bed3db0c47159cecc28921c81f46/FLAG8699dd59f [2020-07-10 14:42:23,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc32375c5/d994bed3db0c47159cecc28921c81f46 [2020-07-10 14:42:23,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:23,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:23,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:23,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:23,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:23,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea9790b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23, skipping insertion in model container [2020-07-10 14:42:23,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:23,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:23,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:23,529 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:23,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:23,695 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:23,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23 WrapperNode [2020-07-10 14:42:23,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:23,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:23,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:23,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:23,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... [2020-07-10 14:42:23,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:23,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:23,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:23,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:23,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:23,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:23,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:23,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-10 14:42:23,847 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-10 14:42:23,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-10 14:42:23,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-10 14:42:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-10 14:42:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:42:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:42:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:42:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:42:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-10 14:42:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-10 14:42:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:42:23,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:42:24,358 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:24,359 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 14:42:24,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:24 BoogieIcfgContainer [2020-07-10 14:42:24,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:24,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:24,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:24,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:24,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:23" (1/3) ... [2020-07-10 14:42:24,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65afa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:24, skipping insertion in model container [2020-07-10 14:42:24,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:23" (2/3) ... [2020-07-10 14:42:24,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65afa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:24, skipping insertion in model container [2020-07-10 14:42:24,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:24" (3/3) ... [2020-07-10 14:42:24,374 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2020-07-10 14:42:24,387 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:24,397 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:24,413 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:24,442 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:24,442 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:24,442 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:24,443 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:24,443 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:24,443 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:24,444 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:24,444 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-10 14:42:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:42:24,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:24,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:24,478 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:24,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash -411440866, now seen corresponding path program 1 times [2020-07-10 14:42:24,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:24,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490338595] [2020-07-10 14:42:24,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#true} is VALID [2020-07-10 14:42:24,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:42:24,740 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:42:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-10 14:42:24,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:24,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:24,800 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:24,800 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:24,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-10 14:42:24,804 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:24,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-10 14:42:24,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:24,806 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:24,806 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:24,807 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:24,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-10 14:42:24,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-10 14:42:24,808 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:24,809 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:42:24,811 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:24,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#true} is VALID [2020-07-10 14:42:24,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:42:24,813 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:42:24,813 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret10 := main(); {47#true} is VALID [2020-07-10 14:42:24,813 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := ~someUnaryFLOAToperation(0.0);~y~0 := 0.0; {47#true} is VALID [2020-07-10 14:42:24,816 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:24,816 INFO L280 TraceCheckUtils]: 7: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-10 14:42:24,818 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:24,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {47#true} is VALID [2020-07-10 14:42:24,820 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:24,820 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:24,821 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:24,821 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:24,821 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-10 14:42:24,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-10 14:42:24,822 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:24,823 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:42:24,823 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {48#false} is VALID [2020-07-10 14:42:24,824 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short9; {48#false} is VALID [2020-07-10 14:42:24,824 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {48#false} is VALID [2020-07-10 14:42:24,824 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-10 14:42:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:24,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490338595] [2020-07-10 14:42:24,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:24,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:24,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696747492] [2020-07-10 14:42:24,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:42:24,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:24,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:24,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:24,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:24,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:24,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:24,908 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-10 14:42:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:25,408 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-10 14:42:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:25,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:42:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:42:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:42:25,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-10 14:42:25,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:25,654 INFO L225 Difference]: With dead ends: 79 [2020-07-10 14:42:25,654 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:42:25,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:42:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:42:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:42:25,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:25,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:25,738 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:25,738 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:25,746 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:25,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:25,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:25,747 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:25,747 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:25,753 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:25,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:25,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:25,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:25,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:42:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:42:25,762 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-10 14:42:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:25,762 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:42:25,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:42:25,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:25,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:25,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:25,765 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1480673795, now seen corresponding path program 1 times [2020-07-10 14:42:25,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:25,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373837298] [2020-07-10 14:42:25,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:25,853 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-10 14:42:25,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:42:25,854 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:42:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:25,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-10 14:42:25,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:25,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:25,985 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,988 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-10 14:42:25,995 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:25,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-10 14:42:25,996 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:25,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:25,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,001 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,002 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,003 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-10 14:42:26,004 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:42:26,004 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:42:26,017 INFO L263 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:26,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-10 14:42:26,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:42:26,018 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:42:26,019 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret10 := main(); {306#true} is VALID [2020-07-10 14:42:26,019 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := ~someUnaryFLOAToperation(0.0);~y~0 := 0.0; {306#true} is VALID [2020-07-10 14:42:26,022 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:26,022 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-10 14:42:26,024 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:26,024 INFO L280 TraceCheckUtils]: 9: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {306#true} is VALID [2020-07-10 14:42:26,025 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:26,025 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:26,027 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,028 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:26,030 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,034 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:26,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-10 14:42:26,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:42:26,036 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:42:26,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {307#false} is VALID [2020-07-10 14:42:26,037 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short9; {307#false} is VALID [2020-07-10 14:42:26,037 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {307#false} is VALID [2020-07-10 14:42:26,037 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-10 14:42:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:26,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373837298] [2020-07-10 14:42:26,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:26,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:26,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603549242] [2020-07-10 14:42:26,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:42:26,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:26,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:26,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:26,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:26,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:26,086 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:42:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:26,760 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-10 14:42:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:26,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:42:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:26,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:42:26,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:26,909 INFO L225 Difference]: With dead ends: 59 [2020-07-10 14:42:26,909 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:42:26,911 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:42:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:42:26,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:26,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,953 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,953 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:26,962 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:26,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:26,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:26,965 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,965 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:26,975 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:26,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:26,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:26,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:26,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:42:26,987 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-10 14:42:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:26,987 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:42:26,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:26,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:26,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:26,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:42:26,990 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1766352133, now seen corresponding path program 1 times [2020-07-10 14:42:26,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:26,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498447272] [2020-07-10 14:42:26,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:27,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {562#true} is VALID [2020-07-10 14:42:27,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:42:27,084 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:42:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:27,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-10 14:42:27,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:27,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:27,228 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:27,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:27,228 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:27,233 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:27,234 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:27,236 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:27,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-10 14:42:27,238 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:27,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-10 14:42:27,239 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:27,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:27,240 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:27,240 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:27,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:27,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:27,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:27,250 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:27,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:27,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-10 14:42:27,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:42:27,253 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:42:27,254 INFO L263 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:27,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {562#true} is VALID [2020-07-10 14:42:27,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:42:27,255 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:42:27,255 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret10 := main(); {562#true} is VALID [2020-07-10 14:42:27,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := ~someUnaryFLOAToperation(0.0);~y~0 := 0.0; {562#true} is VALID [2020-07-10 14:42:27,258 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:27,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-10 14:42:27,261 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:27,262 INFO L280 TraceCheckUtils]: 9: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {562#true} is VALID [2020-07-10 14:42:27,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:27,262 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:27,263 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:27,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:27,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:27,279 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:27,282 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:27,284 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:27,285 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:27,286 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-10 14:42:27,286 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:42:27,286 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:42:27,287 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {563#false} is VALID [2020-07-10 14:42:27,287 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short9; {563#false} is VALID [2020-07-10 14:42:27,287 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short9;havoc #t~ret8;havoc #t~short9; {563#false} is VALID [2020-07-10 14:42:27,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-10 14:42:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:27,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498447272] [2020-07-10 14:42:27,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:27,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:27,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442593314] [2020-07-10 14:42:27,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:42:27,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:27,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:27,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:27,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:27,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:27,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:27,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:27,328 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-10 14:42:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:28,029 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-10 14:42:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:28,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:42:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:28,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:42:28,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:28,166 INFO L225 Difference]: With dead ends: 63 [2020-07-10 14:42:28,167 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 14:42:28,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 14:42:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-10 14:42:28,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:28,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:28,214 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:28,214 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:28,219 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:42:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:42:28,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:28,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:28,223 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-10 14:42:28,223 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-10 14:42:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:28,232 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:42:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:42:28,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:28,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:28,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:28,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:42:28,237 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-10 14:42:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:28,237 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:42:28,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:28,239 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:28,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:28,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:42:28,239 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash -30599226, now seen corresponding path program 1 times [2020-07-10 14:42:28,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:28,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953072726] [2020-07-10 14:42:28,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:28,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 14:42:28,486 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 14:42:28,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:42:28,518 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 14:42:28,519 WARN L170 areAnnotationChecker]: fmin_floatENTRY has no Hoare annotation [2020-07-10 14:42:28,519 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:28,519 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 14:42:28,519 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 14:42:28,519 WARN L170 areAnnotationChecker]: __fpclassify_floatENTRY has no Hoare annotation [2020-07-10 14:42:28,520 WARN L170 areAnnotationChecker]: __signbit_floatENTRY has no Hoare annotation [2020-07-10 14:42:28,520 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 14:42:28,520 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:42:28,520 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-10 14:42:28,520 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:28,520 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 14:42:28,520 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 14:42:28,521 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 14:42:28,521 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-10 14:42:28,521 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-10 14:42:28,521 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:28,521 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 14:42:28,521 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:42:28,521 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-10 14:42:28,522 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:42:28,522 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-10 14:42:28,522 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-10 14:42:28,522 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-10 14:42:28,522 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-10 14:42:28,522 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-10 14:42:28,522 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:42:28,523 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-10 14:42:28,523 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 14:42:28,523 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 14:42:28,523 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 14:42:28,523 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 14:42:28,523 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 14:42:28,523 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2020-07-10 14:42:28,524 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:28,524 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 14:42:28,524 WARN L170 areAnnotationChecker]: __signbit_floatFINAL has no Hoare annotation [2020-07-10 14:42:28,524 WARN L170 areAnnotationChecker]: fmin_floatFINAL has no Hoare annotation [2020-07-10 14:42:28,524 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:42:28,524 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 14:42:28,524 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-10 14:42:28,525 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-10 14:42:28,525 WARN L170 areAnnotationChecker]: L69-4 has no Hoare annotation [2020-07-10 14:42:28,525 WARN L170 areAnnotationChecker]: L69-4 has no Hoare annotation [2020-07-10 14:42:28,525 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 14:42:28,525 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-10 14:42:28,525 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 14:42:28,525 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 14:42:28,526 WARN L170 areAnnotationChecker]: __signbit_floatEXIT has no Hoare annotation [2020-07-10 14:42:28,526 WARN L170 areAnnotationChecker]: fmin_floatEXIT has no Hoare annotation [2020-07-10 14:42:28,526 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-10 14:42:28,526 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2020-07-10 14:42:28,526 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-10 14:42:28,526 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-10 14:42:28,526 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 14:42:28,527 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 14:42:28,528 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:42:28,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:42:28 BoogieIcfgContainer [2020-07-10 14:42:28,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:42:28,534 INFO L168 Benchmark]: Toolchain (without parser) took 5275.76 ms. Allocated memory was 137.9 MB in the beginning and 285.7 MB in the end (delta: 147.8 MB). Free memory was 102.7 MB in the beginning and 253.8 MB in the end (delta: -151.1 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:28,536 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:42:28,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.30 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 180.3 MB in the end (delta: -78.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:28,537 INFO L168 Benchmark]: Boogie Preprocessor took 79.60 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 177.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:28,538 INFO L168 Benchmark]: RCFGBuilder took 586.82 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 147.1 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:28,539 INFO L168 Benchmark]: TraceAbstraction took 4165.87 ms. Allocated memory was 201.3 MB in the beginning and 285.7 MB in the end (delta: 84.4 MB). Free memory was 146.4 MB in the beginning and 253.8 MB in the end (delta: -107.4 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:28,543 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.49 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 436.30 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 180.3 MB in the end (delta: -78.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.60 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 177.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 586.82 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 147.1 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4165.87 ms. Allocated memory was 201.3 MB in the beginning and 285.7 MB in the end (delta: 84.4 MB). Free memory was 146.4 MB in the beginning and 253.8 MB in the end (delta: -107.4 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 70]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someUnaryFLOAToperation at line 64. Possible FailurePath: [L64] float x = -0.0f; [L65] float y = 0.0f; VAL [y=0] [L66] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095043, \old(y)=0] [L36] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043] [L13] __uint32_t w; VAL [\old(x)=2139095043, x=2139095043] [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; VAL [\old(x)=2139095043, \result=0, w=2139095041, x=2139095043] [L36] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043, \old(y)=0, __fpclassify_float(x)=0, x=2139095043, y=0] [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; VAL [\old(x)=2139095043, \old(y)=0, \result=0, x=2139095043, y=0] [L66] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=0, x=2139095043, y=0] [L66] float res = fmin_float(x, y); [L69] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=0, res == -0.0f && __signbit_float(res) == 1=0, x=2139095043, y=0] [L69] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L70] __VERIFIER_error() VAL [res=0, x=2139095043, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 123 SDtfs, 117 SDslu, 43 SDs, 0 SdLazy, 296 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 4170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...