/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/double_req_bl_1250.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:41:07,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:41:07,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:41:07,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:41:07,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:41:07,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:41:07,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:41:07,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:41:07,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:41:07,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:41:07,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:41:07,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:41:07,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:41:07,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:41:07,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:41:07,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:41:07,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:41:07,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:41:07,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:41:07,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:41:07,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:41:07,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:41:07,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:41:07,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:41:07,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:41:07,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:41:07,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:41:07,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:41:07,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:41:07,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:41:07,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:41:07,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:41:07,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:41:07,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:41:07,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:41:07,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:41:07,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:41:07,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:41:07,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:41:07,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:41:07,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:41:07,567 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:41:07,588 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:41:07,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:41:07,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:41:07,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:41:07,590 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:41:07,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:41:07,590 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:41:07,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:41:07,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:41:07,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:41:07,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:41:07,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:41:07,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:41:07,592 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:41:07,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:41:07,592 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:41:07,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:41:07,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:41:07,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:41:07,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:41:07,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:41:07,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:41:07,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:41:07,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:41:07,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:41:07,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:41:07,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:41:07,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:41:07,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:41:07,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:41:07,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:41:07,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:41:07,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:41:07,895 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:41:07,895 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:41:07,896 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1250.c [2020-07-10 14:41:07,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9257f6da1/8624b974973b425da0c1509be2de5f50/FLAGfc72cad0d [2020-07-10 14:41:08,471 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:41:08,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1250.c [2020-07-10 14:41:08,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9257f6da1/8624b974973b425da0c1509be2de5f50/FLAGfc72cad0d [2020-07-10 14:41:08,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9257f6da1/8624b974973b425da0c1509be2de5f50 [2020-07-10 14:41:08,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:41:08,789 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:41:08,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:08,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:41:08,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:41:08,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:08" (1/1) ... [2020-07-10 14:41:08,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce355aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:08, skipping insertion in model container [2020-07-10 14:41:08,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:08" (1/1) ... [2020-07-10 14:41:08,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:41:08,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:41:09,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:09,018 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:41:09,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:09,074 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:41:09,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09 WrapperNode [2020-07-10 14:41:09,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:09,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:41:09,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:41:09,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:41:09,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:41:09,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:41:09,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:41:09,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:41:09,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:41:09,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:41:09,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:41:09,273 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 14:41:09,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 14:41:09,274 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-10 14:41:09,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:41:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:41:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 14:41:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 14:41:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 14:41:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:41:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:41:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:41:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:41:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-10 14:41:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:41:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:41:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:41:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:41:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:41:09,707 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:41:09,708 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 14:41:09,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:09 BoogieIcfgContainer [2020-07-10 14:41:09,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:41:09,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:41:09,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:41:09,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:41:09,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:41:08" (1/3) ... [2020-07-10 14:41:09,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecb1f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:09, skipping insertion in model container [2020-07-10 14:41:09,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09" (2/3) ... [2020-07-10 14:41:09,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecb1f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:09, skipping insertion in model container [2020-07-10 14:41:09,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:09" (3/3) ... [2020-07-10 14:41:09,721 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2020-07-10 14:41:09,731 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:41:09,738 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:41:09,754 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:41:09,779 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:41:09,780 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:41:09,780 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:41:09,780 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:41:09,780 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:41:09,780 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:41:09,780 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:41:09,781 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:41:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 14:41:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:41:09,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:09,806 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:41:09,806 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash 397720622, now seen corresponding path program 1 times [2020-07-10 14:41:09,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:09,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691189296] [2020-07-10 14:41:09,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,054 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:41:10,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:41:10,056 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-10 14:41:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,119 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 ~msw~0;havoc ~lsw~0; {43#true} is VALID [2020-07-10 14:41:10,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:41:10,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {44#false} is VALID [2020-07-10 14:41:10,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:41:10,122 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:41:10,123 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:41:10,125 INFO L263 TraceCheckUtils]: 1: Hoare triple {43#true} call #t~ret4 := __fpclassify_double(~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:41:10,126 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 ~msw~0;havoc ~lsw~0; {43#true} is VALID [2020-07-10 14:41:10,127 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:41:10,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {44#false} is VALID [2020-07-10 14:41:10,128 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:41:10,128 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:41:10,129 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {44#false} is VALID [2020-07-10 14:41:10,129 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {44#false} is VALID [2020-07-10 14:41:10,130 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:41:10,130 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:41:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:41:10,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:41:10,144 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:41:10,145 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:41:10,146 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:41:10,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:41:10,147 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #79#return; {43#true} is VALID [2020-07-10 14:41:10,147 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2020-07-10 14:41:10,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {43#true} is VALID [2020-07-10 14:41:10,150 INFO L263 TraceCheckUtils]: 6: Hoare triple {43#true} call #t~ret7 := fmax_double(~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:41:10,150 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:41:10,152 INFO L263 TraceCheckUtils]: 8: Hoare triple {43#true} call #t~ret4 := __fpclassify_double(~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:41:10,153 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 ~msw~0;havoc ~lsw~0; {43#true} is VALID [2020-07-10 14:41:10,154 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-10 14:41:10,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {44#false} is VALID [2020-07-10 14:41:10,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:41:10,155 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {44#false} {43#true} #75#return; {44#false} is VALID [2020-07-10 14:41:10,155 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {44#false} is VALID [2020-07-10 14:41:10,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {44#false} is VALID [2020-07-10 14:41:10,156 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 14:41:10,156 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {44#false} {43#true} #71#return; {44#false} is VALID [2020-07-10 14:41:10,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~res~0 := #t~ret7;havoc #t~ret7; {44#false} is VALID [2020-07-10 14:41:10,157 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call #t~ret8 := isnan_double(~res~0); {43#true} is VALID [2020-07-10 14:41:10,158 INFO L280 TraceCheckUtils]: 20: Hoare triple {43#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {43#true} is VALID [2020-07-10 14:41:10,158 INFO L280 TraceCheckUtils]: 21: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 14:41:10,158 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {43#true} {44#false} #73#return; {44#false} is VALID [2020-07-10 14:41:10,159 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {44#false} is VALID [2020-07-10 14:41:10,159 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == #t~ret8;havoc #t~ret8; {44#false} is VALID [2020-07-10 14:41:10,160 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 14:41:10,165 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:41:10,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691189296] [2020-07-10 14:41:10,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:10,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:41:10,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886346588] [2020-07-10 14:41:10,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:41:10,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:10,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:41:10,239 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:41:10,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:41:10,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:10,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:41:10,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:41:10,252 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-10 14:41:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:10,684 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2020-07-10 14:41:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:41:10,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-10 14:41:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:41:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2020-07-10 14:41:10,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2020-07-10 14:41:10,881 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:41:10,902 INFO L225 Difference]: With dead ends: 71 [2020-07-10 14:41:10,902 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 14:41:10,911 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:41:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 14:41:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 14:41:10,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:10,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 14:41:10,989 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:41:10,989 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:41:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:10,995 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:41:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:41:10,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:10,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:10,997 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 14:41:10,997 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 14:41:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:11,002 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:41:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:41:11,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:11,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:11,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:11,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 14:41:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-10 14:41:11,010 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2020-07-10 14:41:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:11,010 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-10 14:41:11,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:41:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 14:41:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:41:11,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:11,015 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:41:11,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:41:11,015 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash -54823803, now seen corresponding path program 1 times [2020-07-10 14:41:11,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:11,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40870195] [2020-07-10 14:41:11,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,113 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:41:11,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:41:11,114 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-10 14:41:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,236 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 ~msw~0;havoc ~lsw~0; {282#true} is VALID [2020-07-10 14:41:11,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {282#true} is VALID [2020-07-10 14:41:11,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:41:11,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,239 INFO L280 TraceCheckUtils]: 4: Hoare triple {311#(<= 2 |__fpclassify_double_#res|)} assume true; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,241 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {311#(<= 2 |__fpclassify_double_#res|)} {282#true} #75#return; {310#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,241 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:41:11,243 INFO L263 TraceCheckUtils]: 1: Hoare triple {282#true} call #t~ret4 := __fpclassify_double(~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:41:11,243 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 ~msw~0;havoc ~lsw~0; {282#true} is VALID [2020-07-10 14:41:11,244 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {282#true} is VALID [2020-07-10 14:41:11,244 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:41:11,245 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,246 INFO L280 TraceCheckUtils]: 6: Hoare triple {311#(<= 2 |__fpclassify_double_#res|)} assume true; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,248 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {311#(<= 2 |__fpclassify_double_#res|)} {282#true} #75#return; {310#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {310#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {310#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {310#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {283#false} is VALID [2020-07-10 14:41:11,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:41:11,250 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:41:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:41:11,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:41:11,258 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:41:11,260 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:41:11,260 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:41:11,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:41:11,261 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #79#return; {282#true} is VALID [2020-07-10 14:41:11,261 INFO L263 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret9 := main(); {282#true} is VALID [2020-07-10 14:41:11,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {282#true} is VALID [2020-07-10 14:41:11,263 INFO L263 TraceCheckUtils]: 6: Hoare triple {282#true} call #t~ret7 := fmax_double(~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:41:11,264 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:41:11,265 INFO L263 TraceCheckUtils]: 8: Hoare triple {282#true} call #t~ret4 := __fpclassify_double(~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:41:11,266 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 ~msw~0;havoc ~lsw~0; {282#true} is VALID [2020-07-10 14:41:11,266 INFO L280 TraceCheckUtils]: 10: Hoare triple {282#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {282#true} is VALID [2020-07-10 14:41:11,266 INFO L280 TraceCheckUtils]: 11: Hoare triple {282#true} goto; {282#true} is VALID [2020-07-10 14:41:11,267 INFO L280 TraceCheckUtils]: 12: Hoare triple {282#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,268 INFO L280 TraceCheckUtils]: 13: Hoare triple {311#(<= 2 |__fpclassify_double_#res|)} assume true; {311#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,270 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {311#(<= 2 |__fpclassify_double_#res|)} {282#true} #75#return; {310#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,271 INFO L280 TraceCheckUtils]: 15: Hoare triple {310#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {310#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,272 INFO L280 TraceCheckUtils]: 16: Hoare triple {310#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {283#false} is VALID [2020-07-10 14:41:11,272 INFO L280 TraceCheckUtils]: 17: Hoare triple {283#false} assume true; {283#false} is VALID [2020-07-10 14:41:11,272 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {283#false} {282#true} #71#return; {283#false} is VALID [2020-07-10 14:41:11,273 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#false} ~res~0 := #t~ret7;havoc #t~ret7; {283#false} is VALID [2020-07-10 14:41:11,273 INFO L263 TraceCheckUtils]: 20: Hoare triple {283#false} call #t~ret8 := isnan_double(~res~0); {282#true} is VALID [2020-07-10 14:41:11,276 INFO L280 TraceCheckUtils]: 21: Hoare triple {282#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {282#true} is VALID [2020-07-10 14:41:11,277 INFO L280 TraceCheckUtils]: 22: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 14:41:11,277 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {282#true} {283#false} #73#return; {283#false} is VALID [2020-07-10 14:41:11,277 INFO L280 TraceCheckUtils]: 24: Hoare triple {283#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {283#false} is VALID [2020-07-10 14:41:11,278 INFO L280 TraceCheckUtils]: 25: Hoare triple {283#false} assume 0 == #t~ret8;havoc #t~ret8; {283#false} is VALID [2020-07-10 14:41:11,278 INFO L280 TraceCheckUtils]: 26: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-10 14:41:11,280 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:41:11,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40870195] [2020-07-10 14:41:11,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:11,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:11,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770099603] [2020-07-10 14:41:11,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:41:11,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:11,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:11,324 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:41:11,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:11,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:11,326 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 6 states. [2020-07-10 14:41:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:11,935 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-07-10 14:41:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:11,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 14:41:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:41:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:41:11,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:41:12,037 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:41:12,040 INFO L225 Difference]: With dead ends: 51 [2020-07-10 14:41:12,040 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:41:12,041 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:41:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:41:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:41:12,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:12,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:12,074 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:12,074 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:12,080 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:12,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:12,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:12,083 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:12,084 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:12,093 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:12,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:12,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:12,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:12,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:41:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:41:12,104 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2020-07-10 14:41:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:12,104 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:41:12,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:41:12,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:12,108 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:41:12,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:41:12,110 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash -268248811, now seen corresponding path program 1 times [2020-07-10 14:41:12,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:12,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82931880] [2020-07-10 14:41:12,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,217 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:41:12,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:41:12,218 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-10 14:41:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,320 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 ~msw~0;havoc ~lsw~0; {518#true} is VALID [2020-07-10 14:41:12,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {518#true} is VALID [2020-07-10 14:41:12,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:41:12,321 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {518#true} is VALID [2020-07-10 14:41:12,321 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {518#true} is VALID [2020-07-10 14:41:12,321 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {518#true} is VALID [2020-07-10 14:41:12,322 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 |__fpclassify_double_#res|)} assume true; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,324 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {553#(<= 1 |__fpclassify_double_#res|)} {518#true} #75#return; {552#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,325 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:41:12,326 INFO L263 TraceCheckUtils]: 1: Hoare triple {518#true} call #t~ret4 := __fpclassify_double(~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:41:12,326 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 ~msw~0;havoc ~lsw~0; {518#true} is VALID [2020-07-10 14:41:12,326 INFO L280 TraceCheckUtils]: 3: Hoare triple {518#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {518#true} is VALID [2020-07-10 14:41:12,327 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:41:12,327 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {518#true} is VALID [2020-07-10 14:41:12,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {518#true} is VALID [2020-07-10 14:41:12,327 INFO L280 TraceCheckUtils]: 7: Hoare triple {518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {518#true} is VALID [2020-07-10 14:41:12,328 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,329 INFO L280 TraceCheckUtils]: 9: Hoare triple {553#(<= 1 |__fpclassify_double_#res|)} assume true; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,330 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {553#(<= 1 |__fpclassify_double_#res|)} {518#true} #75#return; {552#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {552#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {552#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {552#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {519#false} is VALID [2020-07-10 14:41:12,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:41:12,333 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:41:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:41:12,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:41:12,339 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:41:12,340 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:41:12,340 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:41:12,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:41:12,341 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #79#return; {518#true} is VALID [2020-07-10 14:41:12,341 INFO L263 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret9 := main(); {518#true} is VALID [2020-07-10 14:41:12,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {518#true} is VALID [2020-07-10 14:41:12,343 INFO L263 TraceCheckUtils]: 6: Hoare triple {518#true} call #t~ret7 := fmax_double(~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:41:12,343 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:41:12,344 INFO L263 TraceCheckUtils]: 8: Hoare triple {518#true} call #t~ret4 := __fpclassify_double(~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:41:12,345 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 ~msw~0;havoc ~lsw~0; {518#true} is VALID [2020-07-10 14:41:12,345 INFO L280 TraceCheckUtils]: 10: Hoare triple {518#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {518#true} is VALID [2020-07-10 14:41:12,345 INFO L280 TraceCheckUtils]: 11: Hoare triple {518#true} goto; {518#true} is VALID [2020-07-10 14:41:12,345 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {518#true} is VALID [2020-07-10 14:41:12,346 INFO L280 TraceCheckUtils]: 13: Hoare triple {518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {518#true} is VALID [2020-07-10 14:41:12,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {518#true} is VALID [2020-07-10 14:41:12,347 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,348 INFO L280 TraceCheckUtils]: 16: Hoare triple {553#(<= 1 |__fpclassify_double_#res|)} assume true; {553#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,349 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {553#(<= 1 |__fpclassify_double_#res|)} {518#true} #75#return; {552#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {552#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {552#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,350 INFO L280 TraceCheckUtils]: 19: Hoare triple {552#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {519#false} is VALID [2020-07-10 14:41:12,350 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#false} assume true; {519#false} is VALID [2020-07-10 14:41:12,351 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {519#false} {518#true} #71#return; {519#false} is VALID [2020-07-10 14:41:12,351 INFO L280 TraceCheckUtils]: 22: Hoare triple {519#false} ~res~0 := #t~ret7;havoc #t~ret7; {519#false} is VALID [2020-07-10 14:41:12,351 INFO L263 TraceCheckUtils]: 23: Hoare triple {519#false} call #t~ret8 := isnan_double(~res~0); {518#true} is VALID [2020-07-10 14:41:12,352 INFO L280 TraceCheckUtils]: 24: Hoare triple {518#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {518#true} is VALID [2020-07-10 14:41:12,352 INFO L280 TraceCheckUtils]: 25: Hoare triple {518#true} assume true; {518#true} is VALID [2020-07-10 14:41:12,352 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {518#true} {519#false} #73#return; {519#false} is VALID [2020-07-10 14:41:12,352 INFO L280 TraceCheckUtils]: 27: Hoare triple {519#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {519#false} is VALID [2020-07-10 14:41:12,353 INFO L280 TraceCheckUtils]: 28: Hoare triple {519#false} assume 0 == #t~ret8;havoc #t~ret8; {519#false} is VALID [2020-07-10 14:41:12,353 INFO L280 TraceCheckUtils]: 29: Hoare triple {519#false} assume !false; {519#false} is VALID [2020-07-10 14:41:12,354 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:41:12,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82931880] [2020-07-10 14:41:12,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:12,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:12,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821688552] [2020-07-10 14:41:12,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:41:12,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:12,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:12,391 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:41:12,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:12,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:12,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:12,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:12,393 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:41:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:12,946 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-10 14:41:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:12,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 14:41:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:41:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-10 14:41:12,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-10 14:41:13,051 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:41:13,055 INFO L225 Difference]: With dead ends: 55 [2020-07-10 14:41:13,055 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:41:13,056 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-10 14:41:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:41:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-07-10 14:41:13,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:13,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 40 states. [2020-07-10 14:41:13,098 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 40 states. [2020-07-10 14:41:13,098 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 40 states. [2020-07-10 14:41:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:13,101 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:13,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:13,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:13,104 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 44 states. [2020-07-10 14:41:13,104 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 44 states. [2020-07-10 14:41:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:13,108 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:13,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:13,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:13,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:13,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:41:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:41:13,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2020-07-10 14:41:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:13,112 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:41:13,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 14:41:13,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:13,114 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:41:13,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:41:13,114 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:13,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1239302998, now seen corresponding path program 1 times [2020-07-10 14:41:13,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:13,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549763455] [2020-07-10 14:41:13,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:13,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:41:13,310 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:41:13,317 INFO L168 Benchmark]: Toolchain (without parser) took 4527.70 ms. Allocated memory was 145.2 MB in the beginning and 246.4 MB in the end (delta: 101.2 MB). Free memory was 103.1 MB in the beginning and 111.0 MB in the end (delta: -7.8 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,318 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.45 ms. Allocated memory is still 145.2 MB. Free memory was 102.7 MB in the beginning and 91.3 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,320 INFO L168 Benchmark]: Boogie Preprocessor took 135.55 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.3 MB in the beginning and 180.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,321 INFO L168 Benchmark]: RCFGBuilder took 500.99 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 151.6 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,321 INFO L168 Benchmark]: TraceAbstraction took 3600.60 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 150.9 MB in the beginning and 111.0 MB in the end (delta: 39.9 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,325 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.45 ms. Allocated memory is still 145.2 MB. Free memory was 102.7 MB in the beginning and 91.3 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.55 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.3 MB in the beginning and 180.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 500.99 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 151.6 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3600.60 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 150.9 MB in the beginning and 111.0 MB in the end (delta: 39.9 MB). Peak memory consumption was 83.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...