/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1230.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:20,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:20,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:20,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:20,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:20,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:20,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:20,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:20,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:20,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:20,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:20,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:20,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:20,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:20,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:20,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:20,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:20,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:20,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:20,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:20,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:20,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:20,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:20,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:20,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:20,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:20,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:20,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:20,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:20,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:20,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:20,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:20,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:20,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:20,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:20,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:20,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:20,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:20,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:20,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:20,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:20,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:42:20,217 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:20,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:20,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:20,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:20,222 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:20,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:20,223 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:20,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:20,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:20,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:20,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:20,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:20,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:20,226 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:20,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:20,226 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:20,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:20,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:20,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:20,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:20,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:20,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:20,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:20,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:20,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:20,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:20,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:20,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:20,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:20,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:20,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:20,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:20,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:20,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:20,581 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:20,582 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-10 14:42:20,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df059d079/65d6fe71bf6c4655b36b2b5ebac7d763/FLAG0ec25891b [2020-07-10 14:42:21,168 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:21,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1230.c [2020-07-10 14:42:21,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df059d079/65d6fe71bf6c4655b36b2b5ebac7d763/FLAG0ec25891b [2020-07-10 14:42:21,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df059d079/65d6fe71bf6c4655b36b2b5ebac7d763 [2020-07-10 14:42:21,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:21,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:21,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:21,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:21,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:21,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fe3b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21, skipping insertion in model container [2020-07-10 14:42:21,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:21,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:21,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:21,744 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:21,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:21,798 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:21,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21 WrapperNode [2020-07-10 14:42:21,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:21,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:21,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:21,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:21,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... [2020-07-10 14:42:21,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:21,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:21,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:21,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:21,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-10 14:42:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-10 14:42:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-10 14:42:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-10 14:42:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:42:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:42:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:42:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:42:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-10 14:42:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-10 14:42:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:42:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:42:22,468 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:22,469 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 14:42:22,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:22 BoogieIcfgContainer [2020-07-10 14:42:22,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:22,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:22,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:22,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:22,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:21" (1/3) ... [2020-07-10 14:42:22,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e819a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:22, skipping insertion in model container [2020-07-10 14:42:22,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:21" (2/3) ... [2020-07-10 14:42:22,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e819a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:22, skipping insertion in model container [2020-07-10 14:42:22,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:22" (3/3) ... [2020-07-10 14:42:22,488 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2020-07-10 14:42:22,502 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:22,510 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:22,525 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:22,549 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:22,549 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:22,550 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:22,550 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:22,550 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:22,550 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:22,550 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:22,551 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 14:42:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:22,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:22,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:22,578 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1674881228, now seen corresponding path program 1 times [2020-07-10 14:42:22,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:22,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765801779] [2020-07-10 14:42:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 14:42:22,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:22,811 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-10 14:42:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-10 14:42:22,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:42:22,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-10 14:42:22,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:22,882 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:42:22,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-10 14:42:22,886 INFO L263 TraceCheckUtils]: 1: Hoare triple {43#true} call #t~ret2 := __fpclassify_float(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:22,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-10 14:42:22,887 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:42:22,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-10 14:42:22,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:22,889 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:42:22,889 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-10 14:42:22,889 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-10 14:42:22,890 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:22,890 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:42:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:22,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:42:22,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:22,906 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:42:22,908 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:22,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 14:42:22,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:22,909 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-10 14:42:22,910 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret7 := main(); {43#true} is VALID [2020-07-10 14:42:22,910 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {43#true} is VALID [2020-07-10 14:42:22,913 INFO L263 TraceCheckUtils]: 6: Hoare triple {43#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:22,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {43#true} is VALID [2020-07-10 14:42:22,915 INFO L263 TraceCheckUtils]: 8: Hoare triple {43#true} call #t~ret2 := __fpclassify_float(~x); {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:22,916 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {43#true} is VALID [2020-07-10 14:42:22,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:42:22,917 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {44#false} is VALID [2020-07-10 14:42:22,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:22,918 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:42:22,918 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-10 14:42:22,919 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-10 14:42:22,919 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:42:22,920 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:42:22,920 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~res~0 := #t~ret5;havoc #t~ret5; {44#false} is VALID [2020-07-10 14:42:22,921 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call #t~ret6 := isnan_float(~res~0); {43#true} is VALID [2020-07-10 14:42:22,921 INFO L280 TraceCheckUtils]: 20: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:42:22,921 INFO L280 TraceCheckUtils]: 21: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:42:22,922 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:42:22,922 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {44#false} is VALID [2020-07-10 14:42:22,922 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == #t~ret6;havoc #t~ret6; {44#false} is VALID [2020-07-10 14:42:22,923 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 14:42:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:22,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765801779] [2020-07-10 14:42:22,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:22,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:22,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835709891] [2020-07-10 14:42:22,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:42:22,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:22,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:22,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:22,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:22,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:23,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:23,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:23,007 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-10 14:42:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:23,455 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2020-07-10 14:42:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:23,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:42:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:42:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:42:23,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2020-07-10 14:42:23,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:23,688 INFO L225 Difference]: With dead ends: 71 [2020-07-10 14:42:23,688 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 14:42:23,693 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-10 14:42:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 14:42:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 14:42:23,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:23,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:23,775 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:23,776 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:23,782 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:42:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:42:23,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:23,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:23,784 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:23,784 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:42:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:23,790 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:42:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:42:23,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:23,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:23,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:23,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 14:42:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-10 14:42:23,797 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2020-07-10 14:42:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:23,798 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-10 14:42:23,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:42:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:42:23,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:23,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:23,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:23,801 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:23,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:23,801 INFO L82 PathProgramCache]: Analyzing trace with hash 312623789, now seen corresponding path program 1 times [2020-07-10 14:42:23,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:23,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278567660] [2020-07-10 14:42:23,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 14:42:23,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:23,892 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-10 14:42:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-10 14:42:24,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-10 14:42:24,028 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:42:24,029 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,030 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,032 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:24,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-10 14:42:24,037 INFO L263 TraceCheckUtils]: 1: Hoare triple {282#true} call #t~ret2 := __fpclassify_float(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:24,037 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-10 14:42:24,038 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-10 14:42:24,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:42:24,039 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,040 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,042 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:24,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:24,044 INFO L280 TraceCheckUtils]: 9: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {283#false} is VALID [2020-07-10 14:42:24,044 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:42:24,044 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:42:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,052 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:42:24,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:24,053 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:42:24,054 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:24,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {302#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 14:42:24,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:24,055 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-10 14:42:24,056 INFO L263 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret7 := main(); {282#true} is VALID [2020-07-10 14:42:24,056 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {282#true} is VALID [2020-07-10 14:42:24,058 INFO L263 TraceCheckUtils]: 6: Hoare triple {282#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:24,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {282#true} is VALID [2020-07-10 14:42:24,060 INFO L263 TraceCheckUtils]: 8: Hoare triple {282#true} call #t~ret2 := __fpclassify_float(~x); {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:24,060 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {282#true} is VALID [2020-07-10 14:42:24,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {282#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {282#true} is VALID [2020-07-10 14:42:24,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:42:24,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {282#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,063 INFO L280 TraceCheckUtils]: 13: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:24,064 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {311#(<= 2 |__fpclassify_float_#res|)} {282#true} #75#return; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:24,065 INFO L280 TraceCheckUtils]: 15: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {310#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:24,066 INFO L280 TraceCheckUtils]: 16: Hoare triple {310#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {283#false} is VALID [2020-07-10 14:42:24,066 INFO L280 TraceCheckUtils]: 17: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:42:24,067 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:42:24,067 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#false} ~res~0 := #t~ret5;havoc #t~ret5; {283#false} is VALID [2020-07-10 14:42:24,067 INFO L263 TraceCheckUtils]: 20: Hoare triple {283#false} call #t~ret6 := isnan_float(~res~0); {282#true} is VALID [2020-07-10 14:42:24,068 INFO L280 TraceCheckUtils]: 21: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:42:24,068 INFO L280 TraceCheckUtils]: 22: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:42:24,068 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:42:24,069 INFO L280 TraceCheckUtils]: 24: Hoare triple {283#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {283#false} is VALID [2020-07-10 14:42:24,069 INFO L280 TraceCheckUtils]: 25: Hoare triple {283#false} assume 0 == #t~ret6;havoc #t~ret6; {283#false} is VALID [2020-07-10 14:42:24,069 INFO L280 TraceCheckUtils]: 26: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-10 14:42:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:24,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278567660] [2020-07-10 14:42:24,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:24,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:24,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78647264] [2020-07-10 14:42:24,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:42:24,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:24,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:24,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:24,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:24,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:24,117 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 6 states. [2020-07-10 14:42:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,729 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-10 14:42:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:24,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:42:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:24,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:42:24,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:24,846 INFO L225 Difference]: With dead ends: 51 [2020-07-10 14:42:24,846 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:42:24,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:42:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:42:24,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:24,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,885 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,885 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,889 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:24,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:24,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:24,891 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,891 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:24,895 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:24,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:24,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:24,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:24,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:42:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:42:24,900 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2020-07-10 14:42:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:24,901 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:42:24,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:42:24,903 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:24,903 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] [2020-07-10 14:42:24,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:42:24,904 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash -409741261, now seen corresponding path program 1 times [2020-07-10 14:42:24,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:24,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141236943] [2020-07-10 14:42:24,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:24,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-10 14:42:24,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:24,981 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-10 14:42:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:25,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-10 14:42:25,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-10 14:42:25,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:42:25,095 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-10 14:42:25,096 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-10 14:42:25,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-10 14:42:25,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,099 INFO L280 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,100 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-10 14:42:25,102 INFO L263 TraceCheckUtils]: 1: Hoare triple {518#true} call #t~ret2 := __fpclassify_float(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:25,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-10 14:42:25,103 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-10 14:42:25,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:42:25,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-10 14:42:25,104 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-10 14:42:25,104 INFO L280 TraceCheckUtils]: 7: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-10 14:42:25,106 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,107 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,118 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,120 INFO L280 TraceCheckUtils]: 11: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,127 INFO L280 TraceCheckUtils]: 12: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {519#false} is VALID [2020-07-10 14:42:25,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:42:25,128 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:42:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:25,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:42:25,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:25,138 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:42:25,142 INFO L263 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:42:25,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {518#true} is VALID [2020-07-10 14:42:25,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:25,143 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-10 14:42:25,144 INFO L263 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret7 := main(); {518#true} is VALID [2020-07-10 14:42:25,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); {518#true} is VALID [2020-07-10 14:42:25,145 INFO L263 TraceCheckUtils]: 6: Hoare triple {518#true} call #t~ret5 := fmin_float(~x~0, ~y~0); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:25,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {518#true} is VALID [2020-07-10 14:42:25,147 INFO L263 TraceCheckUtils]: 8: Hoare triple {518#true} call #t~ret2 := __fpclassify_float(~x); {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:25,147 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~w~0; {518#true} is VALID [2020-07-10 14:42:25,147 INFO L280 TraceCheckUtils]: 10: Hoare triple {518#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {518#true} is VALID [2020-07-10 14:42:25,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:42:25,148 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-10 14:42:25,148 INFO L280 TraceCheckUtils]: 13: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {518#true} is VALID [2020-07-10 14:42:25,148 INFO L280 TraceCheckUtils]: 14: Hoare triple {518#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {518#true} is VALID [2020-07-10 14:42:25,150 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,150 INFO L280 TraceCheckUtils]: 16: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:25,151 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {553#(<= 1 |__fpclassify_float_#res|)} {518#true} #75#return; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,160 INFO L280 TraceCheckUtils]: 18: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {552#(<= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-10 14:42:25,161 INFO L280 TraceCheckUtils]: 19: Hoare triple {552#(<= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {519#false} is VALID [2020-07-10 14:42:25,162 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:42:25,162 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:42:25,162 INFO L280 TraceCheckUtils]: 22: Hoare triple {519#false} ~res~0 := #t~ret5;havoc #t~ret5; {519#false} is VALID [2020-07-10 14:42:25,163 INFO L263 TraceCheckUtils]: 23: Hoare triple {519#false} call #t~ret6 := isnan_float(~res~0); {518#true} is VALID [2020-07-10 14:42:25,163 INFO L280 TraceCheckUtils]: 24: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:42:25,163 INFO L280 TraceCheckUtils]: 25: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:42:25,163 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:42:25,164 INFO L280 TraceCheckUtils]: 27: Hoare triple {519#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {519#false} is VALID [2020-07-10 14:42:25,164 INFO L280 TraceCheckUtils]: 28: Hoare triple {519#false} assume 0 == #t~ret6;havoc #t~ret6; {519#false} is VALID [2020-07-10 14:42:25,164 INFO L280 TraceCheckUtils]: 29: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-10 14:42:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:25,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141236943] [2020-07-10 14:42:25,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:25,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:25,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525329849] [2020-07-10 14:42:25,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:42:25,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:25,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:25,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:25,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:25,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:25,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:25,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:25,213 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:42:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:25,834 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-10 14:42:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:25,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:42:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:42:25,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:42:25,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:25,952 INFO L225 Difference]: With dead ends: 55 [2020-07-10 14:42:25,952 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:42:25,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:42:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-10 14:42:25,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:25,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2020-07-10 14:42:25,989 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2020-07-10 14:42:25,989 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2020-07-10 14:42:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:25,994 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:25,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:25,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:25,995 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2020-07-10 14:42:25,995 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2020-07-10 14:42:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:25,999 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:26,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:26,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:26,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:26,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:42:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:42:26,004 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2020-07-10 14:42:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:26,004 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:42:26,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:42:26,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:26,006 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] [2020-07-10 14:42:26,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:42:26,006 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1097810548, now seen corresponding path program 1 times [2020-07-10 14:42:26,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:26,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503501623] [2020-07-10 14:42:26,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:26,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:42:26,198 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 14:42:26,212 INFO L168 Benchmark]: Toolchain (without parser) took 4701.22 ms. Allocated memory was 137.9 MB in the beginning and 250.6 MB in the end (delta: 112.7 MB). Free memory was 103.0 MB in the beginning and 121.6 MB in the end (delta: -18.6 MB). Peak memory consumption was 94.1 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:26,213 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 14:42:26,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.80 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 91.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:26,214 INFO L168 Benchmark]: Boogie Preprocessor took 132.20 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 178.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:26,215 INFO L168 Benchmark]: RCFGBuilder took 541.77 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 150.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:26,216 INFO L168 Benchmark]: TraceAbstraction took 3730.95 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 150.9 MB in the beginning and 121.6 MB in the end (delta: 29.3 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:26,220 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.47 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.80 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 91.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.20 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 178.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 541.77 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 150.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3730.95 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 150.9 MB in the beginning and 121.6 MB in the end (delta: 29.3 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...