/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-46f3038-m [2020-07-08 11:59:42,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 11:59:42,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 11:59:43,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 11:59:43,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 11:59:43,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 11:59:43,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 11:59:43,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 11:59:43,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 11:59:43,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 11:59:43,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 11:59:43,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 11:59:43,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 11:59:43,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 11:59:43,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 11:59:43,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 11:59:43,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 11:59:43,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 11:59:43,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 11:59:43,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 11:59:43,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 11:59:43,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 11:59:43,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 11:59:43,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 11:59:43,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 11:59:43,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 11:59:43,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 11:59:43,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 11:59:43,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 11:59:43,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 11:59:43,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 11:59:43,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 11:59:43,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 11:59:43,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 11:59:43,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 11:59:43,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 11:59:43,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 11:59:43,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 11:59:43,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 11:59:43,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 11:59:43,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 11:59:43,072 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-08 11:59:43,109 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 11:59:43,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 11:59:43,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 11:59:43,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 11:59:43,114 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 11:59:43,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 11:59:43,115 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 11:59:43,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 11:59:43,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 11:59:43,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 11:59:43,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 11:59:43,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 11:59:43,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 11:59:43,116 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 11:59:43,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 11:59:43,116 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 11:59:43,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 11:59:43,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 11:59:43,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 11:59:43,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 11:59:43,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 11:59:43,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 11:59:43,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 11:59:43,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 11:59:43,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 11:59:43,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 11:59:43,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 11:59:43,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 11:59:43,124 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 11:59:43,124 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 11:59:43,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 11:59:43,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 11:59:43,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 11:59:43,439 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 11:59:43,439 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 11:59:43,440 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-08 11:59:43,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7404029d2/32621f0a4db34d349ffe17a88b33f4f5/FLAGe234af5fa [2020-07-08 11:59:43,940 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 11:59:43,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1230.c [2020-07-08 11:59:43,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7404029d2/32621f0a4db34d349ffe17a88b33f4f5/FLAGe234af5fa [2020-07-08 11:59:44,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7404029d2/32621f0a4db34d349ffe17a88b33f4f5 [2020-07-08 11:59:44,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 11:59:44,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 11:59:44,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 11:59:44,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 11:59:44,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 11:59:44,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b23c3e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44, skipping insertion in model container [2020-07-08 11:59:44,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 11:59:44,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 11:59:44,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 11:59:44,589 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 11:59:44,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 11:59:44,643 INFO L208 MainTranslator]: Completed translation [2020-07-08 11:59:44,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44 WrapperNode [2020-07-08 11:59:44,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 11:59:44,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 11:59:44,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 11:59:44,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 11:59:44,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... [2020-07-08 11:59:44,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 11:59:44,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 11:59:44,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 11:59:44,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 11:59:44,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 11:59:44,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 11:59:44,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 11:59:44,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-08 11:59:44,823 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-08 11:59:44,823 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-08 11:59:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 11:59:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 11:59:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-08 11:59:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 11:59:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 11:59:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 11:59:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 11:59:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-08 11:59:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-08 11:59:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 11:59:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 11:59:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 11:59:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 11:59:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 11:59:45,246 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 11:59:45,246 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 11:59:45,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:59:45 BoogieIcfgContainer [2020-07-08 11:59:45,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 11:59:45,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 11:59:45,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 11:59:45,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 11:59:45,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:59:44" (1/3) ... [2020-07-08 11:59:45,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334109fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:59:45, skipping insertion in model container [2020-07-08 11:59:45,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:44" (2/3) ... [2020-07-08 11:59:45,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334109fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:59:45, skipping insertion in model container [2020-07-08 11:59:45,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:59:45" (3/3) ... [2020-07-08 11:59:45,257 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2020-07-08 11:59:45,265 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 11:59:45,271 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 11:59:45,283 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 11:59:45,305 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 11:59:45,305 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 11:59:45,305 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 11:59:45,305 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 11:59:45,305 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 11:59:45,305 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 11:59:45,305 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 11:59:45,305 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 11:59:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-08 11:59:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 11:59:45,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:59:45,327 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-08 11:59:45,327 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:59:45,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:59:45,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1674881228, now seen corresponding path program 1 times [2020-07-08 11:59:45,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:59:45,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846235011] [2020-07-08 11:59:45,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:59:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:45,584 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-08 11:59:45,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 11:59:45,585 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-08 11:59:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:45,634 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-08 11:59:45,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-08 11:59:45,636 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-08 11:59:45,637 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 11:59:45,637 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-08 11:59:45,638 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-08 11:59:45,640 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-08 11:59:45,640 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-08 11:59:45,641 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-08 11:59:45,642 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-08 11:59:45,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 11:59:45,643 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-08 11:59:45,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-08 11:59:45,644 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-08 11:59:45,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 11:59:45,645 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-08 11:59:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:45,659 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-08 11:59:45,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 11:59:45,660 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-08 11:59:45,662 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-08 11:59:45,662 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-08 11:59:45,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 11:59:45,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-08 11:59:45,663 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret7 := main(); {43#true} is VALID [2020-07-08 11:59:45,664 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-08 11:59:45,666 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-08 11:59:45,667 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-08 11:59:45,668 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-08 11:59:45,669 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-08 11:59:45,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-08 11:59:45,670 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-08 11:59:45,671 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 11:59:45,671 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-08 11:59:45,672 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {44#false} is VALID [2020-07-08 11:59:45,672 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {44#false} is VALID [2020-07-08 11:59:45,672 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 11:59:45,673 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-08 11:59:45,673 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~res~0 := #t~ret5;havoc #t~ret5; {44#false} is VALID [2020-07-08 11:59:45,674 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call #t~ret6 := isnan_float(~res~0); {43#true} is VALID [2020-07-08 11:59:45,674 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-08 11:59:45,674 INFO L280 TraceCheckUtils]: 21: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 11:59:45,675 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-08 11:59:45,675 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {44#false} is VALID [2020-07-08 11:59:45,675 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == #t~ret6;havoc #t~ret6; {44#false} is VALID [2020-07-08 11:59:45,676 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-08 11:59:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 11:59:45,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846235011] [2020-07-08 11:59:45,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:59:45,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 11:59:45,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468856558] [2020-07-08 11:59:45,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-08 11:59:45,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:59:45,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 11:59:45,745 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-08 11:59:45,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 11:59:45,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:59:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 11:59:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 11:59:45,757 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-08 11:59:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:46,169 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2020-07-08 11:59:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 11:59:46,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-08 11:59:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:59:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 11:59:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-08 11:59:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 11:59:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-08 11:59:46,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2020-07-08 11:59:46,345 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-08 11:59:46,365 INFO L225 Difference]: With dead ends: 71 [2020-07-08 11:59:46,365 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 11:59:46,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 11:59:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 11:59:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-08 11:59:46,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:59:46,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-08 11:59:46,459 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 11:59:46,459 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 11:59:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:46,469 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-08 11:59:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-08 11:59:46,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:46,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:46,476 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 11:59:46,476 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 11:59:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:46,483 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-08 11:59:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-08 11:59:46,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:46,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:46,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:59:46,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:59:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 11:59:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-08 11:59:46,489 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2020-07-08 11:59:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:59:46,490 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-08 11:59:46,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 11:59:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-08 11:59:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 11:59:46,492 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:59:46,492 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-08 11:59:46,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 11:59:46,493 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:59:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:59:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash 312623789, now seen corresponding path program 1 times [2020-07-08 11:59:46,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:59:46,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182144059] [2020-07-08 11:59:46,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:59:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:46,582 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-08 11:59:46,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-08 11:59:46,582 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-08 11:59:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:46,672 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-08 11:59:46,673 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-08 11:59:46,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-08 11:59:46,674 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-08 11:59:46,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 11:59:46,676 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-08 11:59:46,677 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-08 11:59:46,678 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-08 11:59:46,678 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-08 11:59:46,679 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-08 11:59:46,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-08 11:59:46,680 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-08 11:59:46,681 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 11:59:46,682 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-08 11:59:46,683 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-08 11:59:46,684 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-08 11:59:46,684 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-08 11:59:46,684 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-08 11:59:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:46,691 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-08 11:59:46,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-08 11:59:46,692 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-08 11:59:46,693 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-08 11:59:46,693 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-08 11:59:46,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-08 11:59:46,694 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-08 11:59:46,694 INFO L263 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret7 := main(); {282#true} is VALID [2020-07-08 11:59:46,694 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-08 11:59:46,696 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-08 11:59:46,696 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-08 11:59:46,698 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-08 11:59:46,698 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-08 11:59:46,698 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-08 11:59:46,698 INFO L280 TraceCheckUtils]: 11: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-08 11:59:46,699 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-08 11:59:46,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {311#(<= 2 |__fpclassify_float_#res|)} assume true; {311#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 11:59:46,701 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-08 11:59:46,702 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-08 11:59:46,703 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-08 11:59:46,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-08 11:59:46,704 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-08 11:59:46,704 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#false} ~res~0 := #t~ret5;havoc #t~ret5; {283#false} is VALID [2020-07-08 11:59:46,704 INFO L263 TraceCheckUtils]: 20: Hoare triple {283#false} call #t~ret6 := isnan_float(~res~0); {282#true} is VALID [2020-07-08 11:59:46,704 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-08 11:59:46,705 INFO L280 TraceCheckUtils]: 22: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-08 11:59:46,705 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-08 11:59:46,705 INFO L280 TraceCheckUtils]: 24: Hoare triple {283#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {283#false} is VALID [2020-07-08 11:59:46,706 INFO L280 TraceCheckUtils]: 25: Hoare triple {283#false} assume 0 == #t~ret6;havoc #t~ret6; {283#false} is VALID [2020-07-08 11:59:46,706 INFO L280 TraceCheckUtils]: 26: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-08 11:59:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 11:59:46,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182144059] [2020-07-08 11:59:46,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:59:46,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 11:59:46,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246707573] [2020-07-08 11:59:46,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-08 11:59:46,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:59:46,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 11:59:46,747 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-08 11:59:46,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 11:59:46,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:59:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 11:59:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 11:59:46,748 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 6 states. [2020-07-08 11:59:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:47,292 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-08 11:59:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 11:59:47,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-08 11:59:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:59:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:59:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 11:59:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:59:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 11:59:47,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-08 11:59:47,395 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-08 11:59:47,398 INFO L225 Difference]: With dead ends: 51 [2020-07-08 11:59:47,398 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 11:59:47,399 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-08 11:59:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 11:59:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-08 11:59:47,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:59:47,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-08 11:59:47,427 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-08 11:59:47,428 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-08 11:59:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:47,431 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-08 11:59:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-08 11:59:47,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:47,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:47,433 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-08 11:59:47,433 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-08 11:59:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:47,436 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-08 11:59:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-08 11:59:47,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:47,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:47,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:59:47,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:59:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 11:59:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-08 11:59:47,441 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2020-07-08 11:59:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:59:47,442 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-08 11:59:47,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 11:59:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-08 11:59:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 11:59:47,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:59:47,443 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-08 11:59:47,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 11:59:47,444 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:59:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:59:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash -409741261, now seen corresponding path program 1 times [2020-07-08 11:59:47,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:59:47,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441399912] [2020-07-08 11:59:47,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:59:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:47,568 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-08 11:59:47,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-08 11:59:47,569 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-08 11:59:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:47,687 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-08 11:59:47,688 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-08 11:59:47,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-08 11:59:47,689 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-08 11:59:47,689 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-08 11:59:47,689 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-08 11:59:47,690 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-08 11:59:47,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 11:59:47,692 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-08 11:59:47,692 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-08 11:59:47,694 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-08 11:59:47,694 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-08 11:59:47,694 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-08 11:59:47,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-08 11:59:47,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-08 11:59:47,695 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-08 11:59:47,695 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-08 11:59:47,696 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-08 11:59:47,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 11:59:47,698 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-08 11:59:47,699 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-08 11:59:47,699 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-08 11:59:47,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-08 11:59:47,700 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-08 11:59:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:47,705 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-08 11:59:47,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-08 11:59:47,705 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-08 11:59:47,706 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-08 11:59:47,707 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-08 11:59:47,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-08 11:59:47,707 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-08 11:59:47,708 INFO L263 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret7 := main(); {518#true} is VALID [2020-07-08 11:59:47,708 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-08 11:59:47,709 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-08 11:59:47,710 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-08 11:59:47,711 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-08 11:59:47,711 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-08 11:59:47,711 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-08 11:59:47,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-08 11:59:47,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {518#true} is VALID [2020-07-08 11:59:47,712 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-08 11:59:47,712 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-08 11:59:47,713 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-08 11:59:47,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {553#(<= 1 |__fpclassify_float_#res|)} assume true; {553#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 11:59:47,715 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-08 11:59:47,715 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-08 11:59:47,716 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-08 11:59:47,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-08 11:59:47,716 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-08 11:59:47,717 INFO L280 TraceCheckUtils]: 22: Hoare triple {519#false} ~res~0 := #t~ret5;havoc #t~ret5; {519#false} is VALID [2020-07-08 11:59:47,717 INFO L263 TraceCheckUtils]: 23: Hoare triple {519#false} call #t~ret6 := isnan_float(~res~0); {518#true} is VALID [2020-07-08 11:59:47,717 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-08 11:59:47,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-08 11:59:47,718 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-08 11:59:47,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {519#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {519#false} is VALID [2020-07-08 11:59:47,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {519#false} assume 0 == #t~ret6;havoc #t~ret6; {519#false} is VALID [2020-07-08 11:59:47,718 INFO L280 TraceCheckUtils]: 29: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-08 11:59:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 11:59:47,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441399912] [2020-07-08 11:59:47,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:59:47,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 11:59:47,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384001562] [2020-07-08 11:59:47,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-08 11:59:47,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:59:47,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 11:59:47,756 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-08 11:59:47,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 11:59:47,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:59:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 11:59:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 11:59:47,757 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-08 11:59:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:48,239 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-08 11:59:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 11:59:48,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-08 11:59:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:59:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:59:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 11:59:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 11:59:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 11:59:48,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-08 11:59:48,327 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-08 11:59:48,330 INFO L225 Difference]: With dead ends: 55 [2020-07-08 11:59:48,330 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 11:59:48,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-08 11:59:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 11:59:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-08 11:59:48,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:59:48,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2020-07-08 11:59:48,368 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2020-07-08 11:59:48,368 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2020-07-08 11:59:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:48,373 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-08 11:59:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-08 11:59:48,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:48,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:48,374 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2020-07-08 11:59:48,374 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2020-07-08 11:59:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:48,378 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-08 11:59:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-08 11:59:48,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:48,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:48,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:59:48,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:59:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 11:59:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-08 11:59:48,382 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2020-07-08 11:59:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:59:48,385 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-08 11:59:48,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 11:59:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-08 11:59:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 11:59:48,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:59:48,386 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-08 11:59:48,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 11:59:48,386 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:59:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:59:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1097810548, now seen corresponding path program 1 times [2020-07-08 11:59:48,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:59:48,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230637699] [2020-07-08 11:59:48,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:59:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 11:59:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 11:59:48,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 11:59:48,589 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:1145) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1014) 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-08 11:59:48,596 INFO L168 Benchmark]: Toolchain (without parser) took 4258.53 ms. Allocated memory was 138.9 MB in the beginning and 248.5 MB in the end (delta: 109.6 MB). Free memory was 102.3 MB in the beginning and 121.2 MB in the end (delta: -18.9 MB). Peak memory consumption was 90.7 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:48,597 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 11:59:48,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.25 ms. Allocated memory is still 138.9 MB. Free memory was 102.1 MB in the beginning and 90.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:48,604 INFO L168 Benchmark]: Boogie Preprocessor took 121.51 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 90.9 MB in the beginning and 178.9 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:48,605 INFO L168 Benchmark]: RCFGBuilder took 481.26 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 151.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:48,610 INFO L168 Benchmark]: TraceAbstraction took 3340.99 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 150.5 MB in the beginning and 121.2 MB in the end (delta: 29.3 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:48,621 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.25 ms. Allocated memory is still 138.9 MB. Free memory was 102.1 MB in the beginning and 90.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.51 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 90.9 MB in the beginning and 178.9 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 481.26 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 151.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3340.99 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 150.5 MB in the beginning and 121.2 MB in the end (delta: 29.3 MB). Peak memory consumption was 76.5 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...