/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/float_req_bl_1230.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:24,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:24,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:24,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:24,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:24,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:24,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:24,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:24,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:24,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:24,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:24,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:24,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:24,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:24,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:24,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:24,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:24,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:24,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:24,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:24,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:24,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:24,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:24,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:24,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:24,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:24,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:24,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:24,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:24,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:24,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:24,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:24,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:24,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:24,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:24,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:24,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:24,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:24,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:24,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:24,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:24,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:24,116 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:24,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:24,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:24,117 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:24,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:24,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:24,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:24,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:24,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:24,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:24,119 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:24,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:24,119 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:24,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:24,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:24,120 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:24,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:24,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:24,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:24,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:24,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:24,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:24,121 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-11 00:33:24,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:24,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:24,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:24,420 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:24,420 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:24,421 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1230.c [2020-07-11 00:33:24,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1b2a3f1/37c8d41670e348f5bb4aba4169c377fc/FLAG47f32c505 [2020-07-11 00:33:24,922 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:24,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1230.c [2020-07-11 00:33:24,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1b2a3f1/37c8d41670e348f5bb4aba4169c377fc/FLAG47f32c505 [2020-07-11 00:33:25,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1b2a3f1/37c8d41670e348f5bb4aba4169c377fc [2020-07-11 00:33:25,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:25,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:25,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:25,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:25,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:25,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354d87e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25, skipping insertion in model container [2020-07-11 00:33:25,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:25,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:25,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:25,622 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:25,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:25,676 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:25,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25 WrapperNode [2020-07-11 00:33:25,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:25,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:25,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:25,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:25,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:25,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:25,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:25,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:25,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (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-11 00:33:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-11 00:33:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-11 00:33:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-11 00:33:25,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-11 00:33:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:33:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:33:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:33:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:33:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-11 00:33:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-11 00:33:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:25,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:33:25,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:33:26,388 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:26,388 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 00:33:26,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:26 BoogieIcfgContainer [2020-07-11 00:33:26,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:26,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:26,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:26,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:26,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:25" (1/3) ... [2020-07-11 00:33:26,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258494d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:26, skipping insertion in model container [2020-07-11 00:33:26,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (2/3) ... [2020-07-11 00:33:26,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258494d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:26, skipping insertion in model container [2020-07-11 00:33:26,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:26" (3/3) ... [2020-07-11 00:33:26,403 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2020-07-11 00:33:26,414 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:26,432 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:26,447 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:26,474 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:26,474 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:26,475 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:26,475 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:26,475 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:26,475 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:26,476 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:26,476 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-07-11 00:33:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 00:33:26,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:26,508 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] [2020-07-11 00:33:26,509 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:26,516 INFO L82 PathProgramCache]: Analyzing trace with hash 337584138, now seen corresponding path program 1 times [2020-07-11 00:33:26,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:26,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546782901] [2020-07-11 00:33:26,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:26,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {76#true} is VALID [2020-07-11 00:33:26,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-11 00:33:26,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-11 00:33:26,762 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-11 00:33:26,763 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-11 00:33:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:26,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-11 00:33:26,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-11 00:33:26,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-11 00:33:26,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-11 00:33:26,827 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-11 00:33:26,828 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-11 00:33:26,828 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-11 00:33:26,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-11 00:33:26,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-11 00:33:26,832 INFO L263 TraceCheckUtils]: 2: Hoare triple {76#true} call #t~ret2 := __fpclassify_float(~x); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:26,832 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-11 00:33:26,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-11 00:33:26,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-11 00:33:26,835 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-11 00:33:26,835 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-11 00:33:26,836 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-11 00:33:26,836 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-11 00:33:26,836 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-11 00:33:26,837 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-11 00:33:26,837 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-11 00:33:26,838 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-11 00:33:26,838 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-11 00:33:26,839 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-11 00:33:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:26,853 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-11 00:33:26,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-11 00:33:26,854 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-11 00:33:26,854 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-11 00:33:26,856 INFO L263 TraceCheckUtils]: 0: Hoare triple {76#true} call ULTIMATE.init(); {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:26,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {76#true} is VALID [2020-07-11 00:33:26,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} #valid := #valid[0 := 0]; {76#true} is VALID [2020-07-11 00:33:26,857 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#true} assume 0 < #StackHeapBarrier; {76#true} is VALID [2020-07-11 00:33:26,857 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-11 00:33:26,858 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {76#true} {76#true} #112#return; {76#true} is VALID [2020-07-11 00:33:26,858 INFO L263 TraceCheckUtils]: 6: Hoare triple {76#true} call #t~ret7 := main(); {76#true} is VALID [2020-07-11 00:33:26,859 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-11 00:33:26,859 INFO L280 TraceCheckUtils]: 8: Hoare triple {76#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {76#true} is VALID [2020-07-11 00:33:26,861 INFO L263 TraceCheckUtils]: 9: Hoare triple {76#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:26,862 INFO L280 TraceCheckUtils]: 10: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-11 00:33:26,862 INFO L280 TraceCheckUtils]: 11: Hoare triple {76#true} ~y := #in~y; {76#true} is VALID [2020-07-11 00:33:26,864 INFO L263 TraceCheckUtils]: 12: Hoare triple {76#true} call #t~ret2 := __fpclassify_float(~x); {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:26,864 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {76#true} is VALID [2020-07-11 00:33:26,864 INFO L280 TraceCheckUtils]: 14: Hoare triple {76#true} havoc ~w~0; {76#true} is VALID [2020-07-11 00:33:26,865 INFO L280 TraceCheckUtils]: 15: Hoare triple {76#true} assume !true; {77#false} is VALID [2020-07-11 00:33:26,866 INFO L280 TraceCheckUtils]: 16: Hoare triple {77#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {77#false} is VALID [2020-07-11 00:33:26,866 INFO L280 TraceCheckUtils]: 17: Hoare triple {77#false} #res := 2; {77#false} is VALID [2020-07-11 00:33:26,866 INFO L280 TraceCheckUtils]: 18: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-11 00:33:26,867 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {77#false} {76#true} #108#return; {77#false} is VALID [2020-07-11 00:33:26,867 INFO L280 TraceCheckUtils]: 20: Hoare triple {77#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {77#false} is VALID [2020-07-11 00:33:26,867 INFO L280 TraceCheckUtils]: 21: Hoare triple {77#false} assume 0 == #t~ret2; {77#false} is VALID [2020-07-11 00:33:26,868 INFO L280 TraceCheckUtils]: 22: Hoare triple {77#false} havoc #t~ret2; {77#false} is VALID [2020-07-11 00:33:26,868 INFO L280 TraceCheckUtils]: 23: Hoare triple {77#false} #res := ~y; {77#false} is VALID [2020-07-11 00:33:26,868 INFO L280 TraceCheckUtils]: 24: Hoare triple {77#false} assume true; {77#false} is VALID [2020-07-11 00:33:26,869 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {77#false} {76#true} #104#return; {77#false} is VALID [2020-07-11 00:33:26,869 INFO L280 TraceCheckUtils]: 26: Hoare triple {77#false} ~res~0 := #t~ret5; {77#false} is VALID [2020-07-11 00:33:26,869 INFO L280 TraceCheckUtils]: 27: Hoare triple {77#false} havoc #t~ret5; {77#false} is VALID [2020-07-11 00:33:26,870 INFO L263 TraceCheckUtils]: 28: Hoare triple {77#false} call #t~ret6 := isnan_float(~res~0); {76#true} is VALID [2020-07-11 00:33:26,870 INFO L280 TraceCheckUtils]: 29: Hoare triple {76#true} ~x := #in~x; {76#true} is VALID [2020-07-11 00:33:26,870 INFO L280 TraceCheckUtils]: 30: Hoare triple {76#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {76#true} is VALID [2020-07-11 00:33:26,871 INFO L280 TraceCheckUtils]: 31: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-11 00:33:26,871 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {76#true} {77#false} #106#return; {77#false} is VALID [2020-07-11 00:33:26,871 INFO L280 TraceCheckUtils]: 33: Hoare triple {77#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {77#false} is VALID [2020-07-11 00:33:26,872 INFO L280 TraceCheckUtils]: 34: Hoare triple {77#false} assume 0 == #t~ret6; {77#false} is VALID [2020-07-11 00:33:26,872 INFO L280 TraceCheckUtils]: 35: Hoare triple {77#false} havoc #t~ret6; {77#false} is VALID [2020-07-11 00:33:26,872 INFO L280 TraceCheckUtils]: 36: Hoare triple {77#false} assume !false; {77#false} is VALID [2020-07-11 00:33:26,876 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-11 00:33:26,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546782901] [2020-07-11 00:33:26,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:26,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:33:26,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813346302] [2020-07-11 00:33:26,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-11 00:33:26,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:26,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:26,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:26,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:26,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:26,974 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2020-07-11 00:33:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:27,576 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-07-11 00:33:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:27,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-07-11 00:33:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-11 00:33:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-11 00:33:27,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2020-07-11 00:33:27,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:27,837 INFO L225 Difference]: With dead ends: 132 [2020-07-11 00:33:27,837 INFO L226 Difference]: Without dead ends: 66 [2020-07-11 00:33:27,845 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-11 00:33:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-11 00:33:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-11 00:33:27,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:27,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:27,972 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:27,972 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:27,986 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-11 00:33:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-11 00:33:27,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:27,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:27,988 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:27,989 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-11 00:33:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:28,006 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-11 00:33:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-11 00:33:28,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:28,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:28,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:28,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-11 00:33:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2020-07-11 00:33:28,027 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 37 [2020-07-11 00:33:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:28,028 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2020-07-11 00:33:28,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:28,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 73 transitions. [2020-07-11 00:33:28,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-11 00:33:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 00:33:28,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:28,148 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] [2020-07-11 00:33:28,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:28,149 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:28,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:28,149 INFO L82 PathProgramCache]: Analyzing trace with hash -356550436, now seen corresponding path program 1 times [2020-07-11 00:33:28,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:28,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070444581] [2020-07-11 00:33:28,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {645#true} is VALID [2020-07-11 00:33:28,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-11 00:33:28,302 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-11 00:33:28,302 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-11 00:33:28,302 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-11 00:33:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-11 00:33:28,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-11 00:33:28,415 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {645#true} is VALID [2020-07-11 00:33:28,415 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {645#true} is VALID [2020-07-11 00:33:28,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {645#true} is VALID [2020-07-11 00:33:28,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-11 00:33:28,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {645#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17-1 {645#true} is VALID [2020-07-11 00:33:28,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-11 00:33:28,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-11 00:33:28,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {645#true} is VALID [2020-07-11 00:33:28,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-11 00:33:28,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-11 00:33:28,418 INFO L280 TraceCheckUtils]: 12: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-11 00:33:28,419 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,421 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-11 00:33:28,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-11 00:33:28,423 INFO L263 TraceCheckUtils]: 2: Hoare triple {645#true} call #t~ret2 := __fpclassify_float(~x); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:28,423 INFO L280 TraceCheckUtils]: 3: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-11 00:33:28,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-11 00:33:28,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {645#true} is VALID [2020-07-11 00:33:28,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {645#true} is VALID [2020-07-11 00:33:28,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {645#true} is VALID [2020-07-11 00:33:28,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-11 00:33:28,425 INFO L280 TraceCheckUtils]: 9: Hoare triple {645#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17-1 {645#true} is VALID [2020-07-11 00:33:28,425 INFO L280 TraceCheckUtils]: 10: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-11 00:33:28,426 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-11 00:33:28,426 INFO L280 TraceCheckUtils]: 12: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {645#true} is VALID [2020-07-11 00:33:28,426 INFO L280 TraceCheckUtils]: 13: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-11 00:33:28,427 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-11 00:33:28,427 INFO L280 TraceCheckUtils]: 15: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-11 00:33:28,428 INFO L280 TraceCheckUtils]: 16: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,428 INFO L280 TraceCheckUtils]: 17: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,430 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,431 INFO L280 TraceCheckUtils]: 20: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-11 00:33:28,431 INFO L280 TraceCheckUtils]: 21: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-11 00:33:28,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-11 00:33:28,432 INFO L280 TraceCheckUtils]: 23: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-11 00:33:28,432 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-11 00:33:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-11 00:33:28,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-11 00:33:28,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-11 00:33:28,439 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-11 00:33:28,440 INFO L263 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:28,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {645#true} is VALID [2020-07-11 00:33:28,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {645#true} #valid := #valid[0 := 0]; {645#true} is VALID [2020-07-11 00:33:28,441 INFO L280 TraceCheckUtils]: 3: Hoare triple {645#true} assume 0 < #StackHeapBarrier; {645#true} is VALID [2020-07-11 00:33:28,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-11 00:33:28,442 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {645#true} {645#true} #112#return; {645#true} is VALID [2020-07-11 00:33:28,442 INFO L263 TraceCheckUtils]: 6: Hoare triple {645#true} call #t~ret7 := main(); {645#true} is VALID [2020-07-11 00:33:28,443 INFO L280 TraceCheckUtils]: 7: Hoare triple {645#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-11 00:33:28,443 INFO L280 TraceCheckUtils]: 8: Hoare triple {645#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {645#true} is VALID [2020-07-11 00:33:28,444 INFO L263 TraceCheckUtils]: 9: Hoare triple {645#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:28,445 INFO L280 TraceCheckUtils]: 10: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-11 00:33:28,445 INFO L280 TraceCheckUtils]: 11: Hoare triple {645#true} ~y := #in~y; {645#true} is VALID [2020-07-11 00:33:28,446 INFO L263 TraceCheckUtils]: 12: Hoare triple {645#true} call #t~ret2 := __fpclassify_float(~x); {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:28,446 INFO L280 TraceCheckUtils]: 13: Hoare triple {682#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {645#true} is VALID [2020-07-11 00:33:28,447 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#true} havoc ~w~0; {645#true} is VALID [2020-07-11 00:33:28,447 INFO L280 TraceCheckUtils]: 15: Hoare triple {645#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {645#true} is VALID [2020-07-11 00:33:28,447 INFO L280 TraceCheckUtils]: 16: Hoare triple {645#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {645#true} is VALID [2020-07-11 00:33:28,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {645#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {645#true} is VALID [2020-07-11 00:33:28,448 INFO L280 TraceCheckUtils]: 18: Hoare triple {645#true} ~w~0 := #t~mem0; {645#true} is VALID [2020-07-11 00:33:28,448 INFO L280 TraceCheckUtils]: 19: Hoare triple {645#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17-1 {645#true} is VALID [2020-07-11 00:33:28,448 INFO L280 TraceCheckUtils]: 20: Hoare triple {645#true} havoc #t~union1; {645#true} is VALID [2020-07-11 00:33:28,448 INFO L280 TraceCheckUtils]: 21: Hoare triple {645#true} havoc #t~mem0; {645#true} is VALID [2020-07-11 00:33:28,449 INFO L280 TraceCheckUtils]: 22: Hoare triple {645#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {645#true} is VALID [2020-07-11 00:33:28,449 INFO L280 TraceCheckUtils]: 23: Hoare triple {645#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {645#true} is VALID [2020-07-11 00:33:28,449 INFO L280 TraceCheckUtils]: 24: Hoare triple {645#true} goto; {645#true} is VALID [2020-07-11 00:33:28,450 INFO L280 TraceCheckUtils]: 25: Hoare triple {645#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {645#true} is VALID [2020-07-11 00:33:28,450 INFO L280 TraceCheckUtils]: 26: Hoare triple {645#true} #res := 2; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,451 INFO L280 TraceCheckUtils]: 27: Hoare triple {700#(<= 2 |__fpclassify_float_#res|)} assume true; {700#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,452 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {700#(<= 2 |__fpclassify_float_#res|)} {645#true} #108#return; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,453 INFO L280 TraceCheckUtils]: 29: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {699#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,454 INFO L280 TraceCheckUtils]: 30: Hoare triple {699#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {646#false} is VALID [2020-07-11 00:33:28,454 INFO L280 TraceCheckUtils]: 31: Hoare triple {646#false} havoc #t~ret2; {646#false} is VALID [2020-07-11 00:33:28,454 INFO L280 TraceCheckUtils]: 32: Hoare triple {646#false} #res := ~y; {646#false} is VALID [2020-07-11 00:33:28,455 INFO L280 TraceCheckUtils]: 33: Hoare triple {646#false} assume true; {646#false} is VALID [2020-07-11 00:33:28,455 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {646#false} {645#true} #104#return; {646#false} is VALID [2020-07-11 00:33:28,455 INFO L280 TraceCheckUtils]: 35: Hoare triple {646#false} ~res~0 := #t~ret5; {646#false} is VALID [2020-07-11 00:33:28,455 INFO L280 TraceCheckUtils]: 36: Hoare triple {646#false} havoc #t~ret5; {646#false} is VALID [2020-07-11 00:33:28,456 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#false} call #t~ret6 := isnan_float(~res~0); {645#true} is VALID [2020-07-11 00:33:28,456 INFO L280 TraceCheckUtils]: 38: Hoare triple {645#true} ~x := #in~x; {645#true} is VALID [2020-07-11 00:33:28,456 INFO L280 TraceCheckUtils]: 39: Hoare triple {645#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {645#true} is VALID [2020-07-11 00:33:28,457 INFO L280 TraceCheckUtils]: 40: Hoare triple {645#true} assume true; {645#true} is VALID [2020-07-11 00:33:28,457 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {645#true} {646#false} #106#return; {646#false} is VALID [2020-07-11 00:33:28,457 INFO L280 TraceCheckUtils]: 42: Hoare triple {646#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {646#false} is VALID [2020-07-11 00:33:28,457 INFO L280 TraceCheckUtils]: 43: Hoare triple {646#false} assume 0 == #t~ret6; {646#false} is VALID [2020-07-11 00:33:28,458 INFO L280 TraceCheckUtils]: 44: Hoare triple {646#false} havoc #t~ret6; {646#false} is VALID [2020-07-11 00:33:28,458 INFO L280 TraceCheckUtils]: 45: Hoare triple {646#false} assume !false; {646#false} is VALID [2020-07-11 00:33:28,461 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-11 00:33:28,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070444581] [2020-07-11 00:33:28,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:28,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:28,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117286841] [2020-07-11 00:33:28,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-11 00:33:28,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:28,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:28,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:28,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:28,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:28,514 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2020-07-11 00:33:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:29,077 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-11 00:33:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:29,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-11 00:33:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-11 00:33:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-11 00:33:29,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-11 00:33:29,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:29,214 INFO L225 Difference]: With dead ends: 87 [2020-07-11 00:33:29,215 INFO L226 Difference]: Without dead ends: 71 [2020-07-11 00:33:29,216 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-11 00:33:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-11 00:33:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2020-07-11 00:33:29,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:29,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2020-07-11 00:33:29,290 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2020-07-11 00:33:29,291 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2020-07-11 00:33:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:29,297 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-11 00:33:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-11 00:33:29,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:29,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:29,299 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2020-07-11 00:33:29,299 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2020-07-11 00:33:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:29,304 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-11 00:33:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2020-07-11 00:33:29,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:29,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:29,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:29,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 00:33:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-11 00:33:29,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 46 [2020-07-11 00:33:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:29,310 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-11 00:33:29,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:29,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-11 00:33:29,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-11 00:33:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-11 00:33:29,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:29,411 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] [2020-07-11 00:33:29,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:29,411 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash -192516793, now seen corresponding path program 1 times [2020-07-11 00:33:29,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:29,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186068507] [2020-07-11 00:33:29,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:29,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1162#true} is VALID [2020-07-11 00:33:29,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-11 00:33:29,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-11 00:33:29,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-11 00:33:29,485 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-11 00:33:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:29,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-11 00:33:29,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-11 00:33:29,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {1162#true} is VALID [2020-07-11 00:33:29,618 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {1162#true} is VALID [2020-07-11 00:33:29,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {1162#true} is VALID [2020-07-11 00:33:29,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-11 00:33:29,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17-1 {1162#true} is VALID [2020-07-11 00:33:29,619 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-11 00:33:29,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-11 00:33:29,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {1162#true} is VALID [2020-07-11 00:33:29,620 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-11 00:33:29,621 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-11 00:33:29,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-11 00:33:29,621 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-11 00:33:29,621 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-11 00:33:29,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-11 00:33:29,623 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,623 INFO L280 TraceCheckUtils]: 17: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,624 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:29,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-11 00:33:29,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-11 00:33:29,626 INFO L263 TraceCheckUtils]: 2: Hoare triple {1162#true} call #t~ret2 := __fpclassify_float(~x); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:29,627 INFO L280 TraceCheckUtils]: 3: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-11 00:33:29,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-11 00:33:29,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {1162#true} is VALID [2020-07-11 00:33:29,627 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {1162#true} is VALID [2020-07-11 00:33:29,628 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {1162#true} is VALID [2020-07-11 00:33:29,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-11 00:33:29,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17-1 {1162#true} is VALID [2020-07-11 00:33:29,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-11 00:33:29,629 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-11 00:33:29,629 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {1162#true} is VALID [2020-07-11 00:33:29,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-11 00:33:29,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-11 00:33:29,630 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-11 00:33:29,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-11 00:33:29,630 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-11 00:33:29,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-11 00:33:29,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,632 INFO L280 TraceCheckUtils]: 20: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,633 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:29,634 INFO L280 TraceCheckUtils]: 22: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:29,635 INFO L280 TraceCheckUtils]: 23: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-11 00:33:29,635 INFO L280 TraceCheckUtils]: 24: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-11 00:33:29,635 INFO L280 TraceCheckUtils]: 25: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-11 00:33:29,635 INFO L280 TraceCheckUtils]: 26: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-11 00:33:29,636 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-11 00:33:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:29,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-11 00:33:29,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-11 00:33:29,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-11 00:33:29,642 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-11 00:33:29,643 INFO L263 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:29,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1162#true} is VALID [2020-07-11 00:33:29,643 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} #valid := #valid[0 := 0]; {1162#true} is VALID [2020-07-11 00:33:29,644 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#true} assume 0 < #StackHeapBarrier; {1162#true} is VALID [2020-07-11 00:33:29,644 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-11 00:33:29,644 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1162#true} {1162#true} #112#return; {1162#true} is VALID [2020-07-11 00:33:29,644 INFO L263 TraceCheckUtils]: 6: Hoare triple {1162#true} call #t~ret7 := main(); {1162#true} is VALID [2020-07-11 00:33:29,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-11 00:33:29,645 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {1162#true} is VALID [2020-07-11 00:33:29,646 INFO L263 TraceCheckUtils]: 9: Hoare triple {1162#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:29,647 INFO L280 TraceCheckUtils]: 10: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-11 00:33:29,647 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} ~y := #in~y; {1162#true} is VALID [2020-07-11 00:33:29,648 INFO L263 TraceCheckUtils]: 12: Hoare triple {1162#true} call #t~ret2 := __fpclassify_float(~x); {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:29,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {1202#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1162#true} is VALID [2020-07-11 00:33:29,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} havoc ~w~0; {1162#true} is VALID [2020-07-11 00:33:29,649 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L14-2 {1162#true} is VALID [2020-07-11 00:33:29,649 INFO L280 TraceCheckUtils]: 16: Hoare triple {1162#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L15 {1162#true} is VALID [2020-07-11 00:33:29,649 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {1162#true} is VALID [2020-07-11 00:33:29,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} ~w~0 := #t~mem0; {1162#true} is VALID [2020-07-11 00:33:29,650 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17-1 {1162#true} is VALID [2020-07-11 00:33:29,650 INFO L280 TraceCheckUtils]: 20: Hoare triple {1162#true} havoc #t~union1; {1162#true} is VALID [2020-07-11 00:33:29,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {1162#true} havoc #t~mem0; {1162#true} is VALID [2020-07-11 00:33:29,650 INFO L280 TraceCheckUtils]: 22: Hoare triple {1162#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L15-1 {1162#true} is VALID [2020-07-11 00:33:29,651 INFO L280 TraceCheckUtils]: 23: Hoare triple {1162#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1162#true} is VALID [2020-07-11 00:33:29,651 INFO L280 TraceCheckUtils]: 24: Hoare triple {1162#true} goto; {1162#true} is VALID [2020-07-11 00:33:29,651 INFO L280 TraceCheckUtils]: 25: Hoare triple {1162#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1162#true} is VALID [2020-07-11 00:33:29,651 INFO L280 TraceCheckUtils]: 26: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1162#true} is VALID [2020-07-11 00:33:29,651 INFO L280 TraceCheckUtils]: 27: Hoare triple {1162#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1162#true} is VALID [2020-07-11 00:33:29,652 INFO L280 TraceCheckUtils]: 28: Hoare triple {1162#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1162#true} is VALID [2020-07-11 00:33:29,652 INFO L280 TraceCheckUtils]: 29: Hoare triple {1162#true} #res := 1; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,653 INFO L280 TraceCheckUtils]: 30: Hoare triple {1223#(= 1 |__fpclassify_float_#res|)} assume true; {1223#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,654 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1223#(= 1 |__fpclassify_float_#res|)} {1162#true} #108#return; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:29,654 INFO L280 TraceCheckUtils]: 32: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1222#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:29,655 INFO L280 TraceCheckUtils]: 33: Hoare triple {1222#(= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {1163#false} is VALID [2020-07-11 00:33:29,655 INFO L280 TraceCheckUtils]: 34: Hoare triple {1163#false} havoc #t~ret2; {1163#false} is VALID [2020-07-11 00:33:29,656 INFO L280 TraceCheckUtils]: 35: Hoare triple {1163#false} #res := ~y; {1163#false} is VALID [2020-07-11 00:33:29,656 INFO L280 TraceCheckUtils]: 36: Hoare triple {1163#false} assume true; {1163#false} is VALID [2020-07-11 00:33:29,656 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1163#false} {1162#true} #104#return; {1163#false} is VALID [2020-07-11 00:33:29,656 INFO L280 TraceCheckUtils]: 38: Hoare triple {1163#false} ~res~0 := #t~ret5; {1163#false} is VALID [2020-07-11 00:33:29,657 INFO L280 TraceCheckUtils]: 39: Hoare triple {1163#false} havoc #t~ret5; {1163#false} is VALID [2020-07-11 00:33:29,657 INFO L263 TraceCheckUtils]: 40: Hoare triple {1163#false} call #t~ret6 := isnan_float(~res~0); {1162#true} is VALID [2020-07-11 00:33:29,657 INFO L280 TraceCheckUtils]: 41: Hoare triple {1162#true} ~x := #in~x; {1162#true} is VALID [2020-07-11 00:33:29,657 INFO L280 TraceCheckUtils]: 42: Hoare triple {1162#true} #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {1162#true} is VALID [2020-07-11 00:33:29,657 INFO L280 TraceCheckUtils]: 43: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-11 00:33:29,658 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1162#true} {1163#false} #106#return; {1163#false} is VALID [2020-07-11 00:33:29,658 INFO L280 TraceCheckUtils]: 45: Hoare triple {1163#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {1163#false} is VALID [2020-07-11 00:33:29,658 INFO L280 TraceCheckUtils]: 46: Hoare triple {1163#false} assume 0 == #t~ret6; {1163#false} is VALID [2020-07-11 00:33:29,658 INFO L280 TraceCheckUtils]: 47: Hoare triple {1163#false} havoc #t~ret6; {1163#false} is VALID [2020-07-11 00:33:29,659 INFO L280 TraceCheckUtils]: 48: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2020-07-11 00:33:29,661 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-11 00:33:29,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186068507] [2020-07-11 00:33:29,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:29,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:29,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915996446] [2020-07-11 00:33:29,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-11 00:33:29,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:29,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:29,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:29,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:29,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:29,708 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 6 states. [2020-07-11 00:33:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:30,291 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-07-11 00:33:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:30,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-11 00:33:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-11 00:33:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-11 00:33:30,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-11 00:33:30,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:30,426 INFO L225 Difference]: With dead ends: 91 [2020-07-11 00:33:30,426 INFO L226 Difference]: Without dead ends: 75 [2020-07-11 00:33:30,427 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-11 00:33:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-11 00:33:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2020-07-11 00:33:30,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:30,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 70 states. [2020-07-11 00:33:30,490 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 70 states. [2020-07-11 00:33:30,491 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 70 states. [2020-07-11 00:33:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:30,496 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-11 00:33:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-11 00:33:30,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:30,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:30,498 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 75 states. [2020-07-11 00:33:30,498 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 75 states. [2020-07-11 00:33:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:30,502 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2020-07-11 00:33:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-11 00:33:30,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:30,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:30,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:30,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 00:33:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-07-11 00:33:30,508 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 49 [2020-07-11 00:33:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:30,508 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-07-11 00:33:30,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:30,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 78 transitions. [2020-07-11 00:33:30,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-07-11 00:33:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-11 00:33:30,588 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:30,589 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] [2020-07-11 00:33:30,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:30,589 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash -587463417, now seen corresponding path program 1 times [2020-07-11 00:33:30,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:30,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628769230] [2020-07-11 00:33:30,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:30,797 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:33:30,798 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:33:30,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:33:30,834 WARN L170 areAnnotationChecker]: isnan_floatENTRY has no Hoare annotation [2020-07-11 00:33:30,834 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 00:33:30,834 WARN L170 areAnnotationChecker]: fmin_floatENTRY has no Hoare annotation [2020-07-11 00:33:30,834 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:30,834 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:33:30,834 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: __fpclassify_floatENTRY has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-11 00:33:30,835 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: isnan_floatFINAL has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-11 00:33:30,836 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: isnan_floatEXIT has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-11 00:33:30,837 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 00:33:30,838 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-11 00:33:30,839 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: L58-4 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-11 00:33:30,840 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-11 00:33:30,841 WARN L170 areAnnotationChecker]: fmin_floatFINAL has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: fmin_floatEXIT has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-11 00:33:30,842 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-11 00:33:30,843 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-11 00:33:30,844 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-11 00:33:30,844 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-11 00:33:30,844 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-11 00:33:30,844 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 00:33:30,844 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-11 00:33:30,844 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-11 00:33:30,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:33:30 BoogieIcfgContainer [2020-07-11 00:33:30,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:33:30,851 INFO L168 Benchmark]: Toolchain (without parser) took 5474.10 ms. Allocated memory was 135.8 MB in the beginning and 295.2 MB in the end (delta: 159.4 MB). Free memory was 100.4 MB in the beginning and 156.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:30,852 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:30,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.21 ms. Allocated memory is still 135.8 MB. Free memory was 100.2 MB in the beginning and 88.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:30,854 INFO L168 Benchmark]: Boogie Preprocessor took 131.05 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 88.9 MB in the beginning and 176.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:30,854 INFO L168 Benchmark]: RCFGBuilder took 585.36 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 144.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:30,855 INFO L168 Benchmark]: TraceAbstraction took 4452.65 ms. Allocated memory was 199.8 MB in the beginning and 295.2 MB in the end (delta: 95.4 MB). Free memory was 143.7 MB in the beginning and 156.2 MB in the end (delta: -12.5 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:30,859 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.26 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 299.21 ms. Allocated memory is still 135.8 MB. Free memory was 100.2 MB in the beginning and 88.9 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.05 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 88.9 MB in the beginning and 176.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 585.36 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 144.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4452.65 ms. Allocated memory was 199.8 MB in the beginning and 295.2 MB in the end (delta: 95.4 MB). Free memory was 143.7 MB in the beginning and 156.2 MB in the end (delta: -12.5 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 55. Possible FailurePath: [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L56] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2147483649, \old(y)=2147483650] [L35] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2147483649] [L12] __uint32_t w; VAL [\old(x)=2147483649, x=2147483649] [L15] ieee_float_shape_type gf_u; VAL [\old(x)=2147483649, gf_u={2:0}, x=2147483649] [L16] gf_u.value = (x) VAL [\old(x)=2147483649, gf_u={2:0}, x=2147483649] [L17] EXPR gf_u.word VAL [\old(x)=2147483649, gf_u={2:0}, gf_u.word=2147483647, x=2147483649] [L17] (w) = gf_u.word VAL [\old(x)=2147483649, gf_u={2:0}, gf_u.word=2147483647, w=2147483647, x=2147483649] [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) VAL [\old(x)=2147483649, w=2147483647, x=2147483649] [L31] return 0; VAL [\old(x)=2147483649, \result=0, w=2147483647, x=2147483649] [L35] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2147483649, \old(y)=2147483650, __fpclassify_float(x)=0, x=2147483649, y=2147483650] [L35] COND TRUE __fpclassify_float(x) == 0 VAL [\old(x)=2147483649, \old(y)=2147483650, __fpclassify_float(x)=0, x=2147483649, y=2147483650] [L36] return y; VAL [\old(x)=2147483649, \old(y)=2147483650, \result=2147483650, x=2147483649, y=2147483650] [L56] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2147483650, x=2147483649, y=2147483650] [L56] float res = fmin_float(x, y); VAL [fmin_float(x, y)=2147483650, res=2147483650, x=2147483649, y=2147483650] [L58] CALL, EXPR isnan_float(res) VAL [\old(x)=2147483650] [L44] return x != x; VAL [\old(x)=2147483650, \result=0, x=2147483650] [L58] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2147483650, x=2147483649, y=2147483650] [L58] COND TRUE !isnan_float(res) VAL [isnan_float(res)=0, res=2147483650, x=2147483649, y=2147483650] [L59] __VERIFIER_error() VAL [res=2147483650, x=2147483649, y=2147483650] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.3s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 221 SDtfs, 59 SDslu, 387 SDs, 0 SdLazy, 288 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 10626 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...