/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_1251b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:41:07,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:41:07,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:41:07,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:41:07,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:41:07,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:41:07,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:41:07,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:41:07,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:41:07,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:41:07,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:41:07,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:41:07,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:41:07,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:41:07,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:41:07,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:41:07,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:41:07,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:41:07,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:41:07,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:41:07,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:41:07,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:41:07,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:41:07,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:41:07,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:41:07,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:41:07,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:41:07,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:41:07,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:41:07,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:41:07,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:41:07,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:41:07,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:41:07,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:41:07,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:41:07,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:41:07,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:41:07,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:41:07,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:41:07,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:41:07,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:41:07,834 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,850 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:41:07,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:41:07,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:41:07,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:41:07,852 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:41:07,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:41:07,852 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:41:07,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:41:07,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:41:07,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:41:07,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:41:07,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:41:07,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:41:07,854 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:41:07,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:41:07,854 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:41:07,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:41:07,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:41:07,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:41:07,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:41:07,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:41:07,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:41:07,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:41:07,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:41:07,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:41:07,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:41:07,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:41:07,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:41:07,857 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:41:07,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:41:08,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:41:08,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:41:08,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:41:08,206 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:41:08,206 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:41:08,207 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-07-10 14:41:08,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d2353b8/03f92dfd36234a75b9a5eebbeedbbc1e/FLAG3a5f3754f [2020-07-10 14:41:08,779 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:41:08,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-07-10 14:41:08,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d2353b8/03f92dfd36234a75b9a5eebbeedbbc1e/FLAG3a5f3754f [2020-07-10 14:41:09,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d2353b8/03f92dfd36234a75b9a5eebbeedbbc1e [2020-07-10 14:41:09,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:41:09,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:41:09,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:09,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:41:09,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:41:09,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cdcd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:09, skipping insertion in model container [2020-07-10 14:41:09,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:41:09" (1/1) ... [2020-07-10 14:41:09,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:41:09,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:41:09,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:09,416 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:41:09,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:09,570 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:41:09,571 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,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:09,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:41:09,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:41:09,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:41:09,587 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,589 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,600 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,601 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,615 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,622 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,623 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,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:41:09,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:41:09,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:41:09,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:41:09,643 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,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:41:09,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:41:09,719 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 14:41:09,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 14:41:09,719 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-10 14:41:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:41:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:41:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 14:41:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 14:41:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 14:41:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:41:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:41:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:41:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:41:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-10 14:41:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:41:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:41:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:41:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:41:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:41:10,196 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:41:10,196 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 14:41:10,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:10 BoogieIcfgContainer [2020-07-10 14:41:10,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:41:10,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:41:10,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:41:10,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:41:10,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:41:09" (1/3) ... [2020-07-10 14:41:10,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c39fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:10, skipping insertion in model container [2020-07-10 14:41:10,207 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:10,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c39fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:10, skipping insertion in model container [2020-07-10 14:41:10,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:10" (3/3) ... [2020-07-10 14:41:10,209 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-07-10 14:41:10,220 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:41:10,228 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:41:10,242 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:41:10,264 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:41:10,264 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:41:10,265 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:41:10,265 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:41:10,265 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:41:10,265 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:41:10,265 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:41:10,265 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:41:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-10 14:41:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:41:10,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:10,293 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:10,294 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1800374877, now seen corresponding path program 1 times [2020-07-10 14:41:10,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:10,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179819629] [2020-07-10 14:41:10,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(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; {45#true} is VALID [2020-07-10 14:41:10,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 14:41:10,616 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #86#return; {45#true} is VALID [2020-07-10 14:41:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {45#true} is VALID [2020-07-10 14:41:10,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 14:41:10,628 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} #78#return; {45#true} is VALID [2020-07-10 14:41:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:10,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(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; {45#true} is VALID [2020-07-10 14:41:10,701 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#true} assume !true; {46#false} is VALID [2020-07-10 14:41:10,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {46#false} is VALID [2020-07-10 14:41:10,702 INFO L280 TraceCheckUtils]: 3: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-10 14:41:10,703 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {46#false} {45#true} #82#return; {46#false} is VALID [2020-07-10 14:41:10,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {45#true} is VALID [2020-07-10 14:41:10,711 INFO L263 TraceCheckUtils]: 1: Hoare triple {45#true} call #t~ret4 := __fpclassify_double(~x); {65#(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,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#(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; {45#true} is VALID [2020-07-10 14:41:10,714 INFO L280 TraceCheckUtils]: 3: Hoare triple {45#true} assume !true; {46#false} is VALID [2020-07-10 14:41:10,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {46#false} is VALID [2020-07-10 14:41:10,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-10 14:41:10,716 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {46#false} {45#true} #82#return; {46#false} is VALID [2020-07-10 14:41:10,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {46#false} is VALID [2020-07-10 14:41:10,717 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {46#false} is VALID [2020-07-10 14:41:10,717 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-10 14:41:10,717 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {46#false} {45#true} #80#return; {46#false} is VALID [2020-07-10 14:41:10,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {64#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:41:10,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#(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; {45#true} is VALID [2020-07-10 14:41:10,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 14:41:10,723 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #86#return; {45#true} is VALID [2020-07-10 14:41:10,723 INFO L263 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret10 := main(); {45#true} is VALID [2020-07-10 14:41:10,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {45#true} ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {45#true} is VALID [2020-07-10 14:41:10,724 INFO L263 TraceCheckUtils]: 6: Hoare triple {45#true} call #t~ret8 := isnan_double(~x~0); {45#true} is VALID [2020-07-10 14:41:10,725 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {45#true} is VALID [2020-07-10 14:41:10,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#true} assume true; {45#true} is VALID [2020-07-10 14:41:10,726 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {45#true} {45#true} #78#return; {45#true} is VALID [2020-07-10 14:41:10,726 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {45#true} is VALID [2020-07-10 14:41:10,726 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#true} assume 0 == #t~ret8;havoc #t~ret8; {45#true} is VALID [2020-07-10 14:41:10,729 INFO L263 TraceCheckUtils]: 12: Hoare triple {45#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {65#(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,730 INFO L280 TraceCheckUtils]: 13: Hoare triple {65#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {45#true} is VALID [2020-07-10 14:41:10,733 INFO L263 TraceCheckUtils]: 14: Hoare triple {45#true} call #t~ret4 := __fpclassify_double(~x); {65#(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,734 INFO L280 TraceCheckUtils]: 15: Hoare triple {65#(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; {45#true} is VALID [2020-07-10 14:41:10,735 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#true} assume !true; {46#false} is VALID [2020-07-10 14:41:10,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {46#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {46#false} is VALID [2020-07-10 14:41:10,736 INFO L280 TraceCheckUtils]: 18: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-10 14:41:10,736 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {46#false} {45#true} #82#return; {46#false} is VALID [2020-07-10 14:41:10,737 INFO L280 TraceCheckUtils]: 20: Hoare triple {46#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {46#false} is VALID [2020-07-10 14:41:10,737 INFO L280 TraceCheckUtils]: 21: Hoare triple {46#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {46#false} is VALID [2020-07-10 14:41:10,738 INFO L280 TraceCheckUtils]: 22: Hoare triple {46#false} assume true; {46#false} is VALID [2020-07-10 14:41:10,738 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {46#false} {45#true} #80#return; {46#false} is VALID [2020-07-10 14:41:10,738 INFO L280 TraceCheckUtils]: 24: Hoare triple {46#false} ~res~0 := #t~ret9;havoc #t~ret9; {46#false} is VALID [2020-07-10 14:41:10,739 INFO L280 TraceCheckUtils]: 25: Hoare triple {46#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {46#false} is VALID [2020-07-10 14:41:10,739 INFO L280 TraceCheckUtils]: 26: Hoare triple {46#false} assume !false; {46#false} is VALID [2020-07-10 14:41:10,748 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,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179819629] [2020-07-10 14:41:10,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:10,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:41:10,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870994047] [2020-07-10 14:41:10,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 14:41:10,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:10,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:41:10,858 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:10,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:41:10,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:10,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:41:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:41:10,871 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2020-07-10 14:41:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:11,332 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2020-07-10 14:41:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:41:11,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 14:41:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2020-07-10 14:41:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2020-07-10 14:41:11,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2020-07-10 14:41:11,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:11,524 INFO L225 Difference]: With dead ends: 72 [2020-07-10 14:41:11,524 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 14:41:11,528 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:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 14:41:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-10 14:41:11,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:11,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-10 14:41:11,600 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 14:41:11,600 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 14:41:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:11,607 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-10 14:41:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-10 14:41:11,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:11,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:11,609 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 14:41:11,609 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 14:41:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:11,614 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-10 14:41:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-10 14:41:11,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:11,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:11,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:11,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 14:41:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-07-10 14:41:11,622 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2020-07-10 14:41:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:11,622 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-07-10 14:41:11,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:41:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-10 14:41:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 14:41:11,624 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:11,624 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] [2020-07-10 14:41:11,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:41:11,625 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:11,625 INFO L82 PathProgramCache]: Analyzing trace with hash 283227385, now seen corresponding path program 1 times [2020-07-10 14:41:11,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:11,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390608317] [2020-07-10 14:41:11,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#(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; {286#true} is VALID [2020-07-10 14:41:11,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-10 14:41:11,724 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} #86#return; {286#true} is VALID [2020-07-10 14:41:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {286#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {286#true} is VALID [2020-07-10 14:41:11,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-10 14:41:11,731 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} #78#return; {286#true} is VALID [2020-07-10 14:41:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:11,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#(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; {286#true} is VALID [2020-07-10 14:41:11,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {286#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~union1;havoc #t~mem0;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; {286#true} is VALID [2020-07-10 14:41:11,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {286#true} goto; {286#true} is VALID [2020-07-10 14:41:11,830 INFO L280 TraceCheckUtils]: 3: Hoare triple {286#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,830 INFO L280 TraceCheckUtils]: 4: Hoare triple {315#(<= 2 |__fpclassify_double_#res|)} assume true; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,832 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {315#(<= 2 |__fpclassify_double_#res|)} {286#true} #82#return; {314#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {286#true} is VALID [2020-07-10 14:41:11,834 INFO L263 TraceCheckUtils]: 1: Hoare triple {286#true} call #t~ret4 := __fpclassify_double(~x); {307#(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,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#(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; {286#true} is VALID [2020-07-10 14:41:11,835 INFO L280 TraceCheckUtils]: 3: Hoare triple {286#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~union1;havoc #t~mem0;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; {286#true} is VALID [2020-07-10 14:41:11,835 INFO L280 TraceCheckUtils]: 4: Hoare triple {286#true} goto; {286#true} is VALID [2020-07-10 14:41:11,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {286#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {315#(<= 2 |__fpclassify_double_#res|)} assume true; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,838 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {315#(<= 2 |__fpclassify_double_#res|)} {286#true} #82#return; {314#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {314#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {314#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {314#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {287#false} is VALID [2020-07-10 14:41:11,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {287#false} assume true; {287#false} is VALID [2020-07-10 14:41:11,841 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {287#false} {286#true} #80#return; {287#false} is VALID [2020-07-10 14:41:11,842 INFO L263 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:41:11,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#(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; {286#true} is VALID [2020-07-10 14:41:11,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-10 14:41:11,844 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} #86#return; {286#true} is VALID [2020-07-10 14:41:11,844 INFO L263 TraceCheckUtils]: 4: Hoare triple {286#true} call #t~ret10 := main(); {286#true} is VALID [2020-07-10 14:41:11,844 INFO L280 TraceCheckUtils]: 5: Hoare triple {286#true} ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {286#true} is VALID [2020-07-10 14:41:11,845 INFO L263 TraceCheckUtils]: 6: Hoare triple {286#true} call #t~ret8 := isnan_double(~x~0); {286#true} is VALID [2020-07-10 14:41:11,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {286#true} is VALID [2020-07-10 14:41:11,845 INFO L280 TraceCheckUtils]: 8: Hoare triple {286#true} assume true; {286#true} is VALID [2020-07-10 14:41:11,846 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {286#true} {286#true} #78#return; {286#true} is VALID [2020-07-10 14:41:11,846 INFO L280 TraceCheckUtils]: 10: Hoare triple {286#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {286#true} is VALID [2020-07-10 14:41:11,846 INFO L280 TraceCheckUtils]: 11: Hoare triple {286#true} assume 0 == #t~ret8;havoc #t~ret8; {286#true} is VALID [2020-07-10 14:41:11,848 INFO L263 TraceCheckUtils]: 12: Hoare triple {286#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {307#(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,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {286#true} is VALID [2020-07-10 14:41:11,850 INFO L263 TraceCheckUtils]: 14: Hoare triple {286#true} call #t~ret4 := __fpclassify_double(~x); {307#(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,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {307#(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; {286#true} is VALID [2020-07-10 14:41:11,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {286#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~union1;havoc #t~mem0;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; {286#true} is VALID [2020-07-10 14:41:11,851 INFO L280 TraceCheckUtils]: 17: Hoare triple {286#true} goto; {286#true} is VALID [2020-07-10 14:41:11,852 INFO L280 TraceCheckUtils]: 18: Hoare triple {286#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,853 INFO L280 TraceCheckUtils]: 19: Hoare triple {315#(<= 2 |__fpclassify_double_#res|)} assume true; {315#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:11,854 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {315#(<= 2 |__fpclassify_double_#res|)} {286#true} #82#return; {314#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,855 INFO L280 TraceCheckUtils]: 21: Hoare triple {314#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {314#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:11,856 INFO L280 TraceCheckUtils]: 22: Hoare triple {314#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {287#false} is VALID [2020-07-10 14:41:11,856 INFO L280 TraceCheckUtils]: 23: Hoare triple {287#false} assume true; {287#false} is VALID [2020-07-10 14:41:11,856 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {287#false} {286#true} #80#return; {287#false} is VALID [2020-07-10 14:41:11,857 INFO L280 TraceCheckUtils]: 25: Hoare triple {287#false} ~res~0 := #t~ret9;havoc #t~ret9; {287#false} is VALID [2020-07-10 14:41:11,857 INFO L280 TraceCheckUtils]: 26: Hoare triple {287#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {287#false} is VALID [2020-07-10 14:41:11,857 INFO L280 TraceCheckUtils]: 27: Hoare triple {287#false} assume !false; {287#false} is VALID [2020-07-10 14:41:11,859 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,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390608317] [2020-07-10 14:41:11,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:11,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:11,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226364868] [2020-07-10 14:41:11,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 14:41:11,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:11,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:11,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:11,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:11,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:11,909 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 6 states. [2020-07-10 14:41:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:12,535 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2020-07-10 14:41:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:12,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 14:41:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 14:41:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 14:41:12,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 14:41:12,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:12,641 INFO L225 Difference]: With dead ends: 47 [2020-07-10 14:41:12,641 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 14:41:12,642 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:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 14:41:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-10 14:41:12,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:12,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-10 14:41:12,673 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 14:41:12,673 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 14:41:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:12,678 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-10 14:41:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-10 14:41:12,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:12,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:12,680 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 14:41:12,680 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 14:41:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:12,684 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-10 14:41:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-10 14:41:12,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:12,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:12,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:12,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 14:41:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-10 14:41:12,690 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2020-07-10 14:41:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:12,690 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-10 14:41:12,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-10 14:41:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 14:41:12,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:12,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:41:12,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:41:12,695 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash 827998108, now seen corresponding path program 1 times [2020-07-10 14:41:12,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:12,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395958656] [2020-07-10 14:41:12,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {542#(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; {519#true} is VALID [2020-07-10 14:41:12,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-10 14:41:12,804 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #86#return; {519#true} is VALID [2020-07-10 14:41:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {519#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {519#true} is VALID [2020-07-10 14:41:12,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-10 14:41:12,810 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #78#return; {519#true} is VALID [2020-07-10 14:41:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:12,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {543#(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; {519#true} is VALID [2020-07-10 14:41:12,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#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~union1;havoc #t~mem0;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; {519#true} is VALID [2020-07-10 14:41:12,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#true} goto; {519#true} is VALID [2020-07-10 14:41:12,919 INFO L280 TraceCheckUtils]: 3: Hoare triple {519#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {519#true} is VALID [2020-07-10 14:41:12,919 INFO L280 TraceCheckUtils]: 4: Hoare triple {519#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {519#true} is VALID [2020-07-10 14:41:12,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {519#true} is VALID [2020-07-10 14:41:12,921 INFO L280 TraceCheckUtils]: 6: Hoare triple {519#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,921 INFO L280 TraceCheckUtils]: 7: Hoare triple {554#(<= 1 |__fpclassify_double_#res|)} assume true; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,922 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {554#(<= 1 |__fpclassify_double_#res|)} {519#true} #82#return; {553#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {543#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {519#true} is VALID [2020-07-10 14:41:12,924 INFO L263 TraceCheckUtils]: 1: Hoare triple {519#true} call #t~ret4 := __fpclassify_double(~x); {543#(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,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {543#(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; {519#true} is VALID [2020-07-10 14:41:12,925 INFO L280 TraceCheckUtils]: 3: Hoare triple {519#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~union1;havoc #t~mem0;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; {519#true} is VALID [2020-07-10 14:41:12,925 INFO L280 TraceCheckUtils]: 4: Hoare triple {519#true} goto; {519#true} is VALID [2020-07-10 14:41:12,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {519#true} is VALID [2020-07-10 14:41:12,926 INFO L280 TraceCheckUtils]: 6: Hoare triple {519#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {519#true} is VALID [2020-07-10 14:41:12,926 INFO L280 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {519#true} is VALID [2020-07-10 14:41:12,927 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {554#(<= 1 |__fpclassify_double_#res|)} assume true; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,929 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {554#(<= 1 |__fpclassify_double_#res|)} {519#true} #82#return; {553#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {553#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {553#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {553#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {520#false} is VALID [2020-07-10 14:41:12,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {520#false} assume true; {520#false} is VALID [2020-07-10 14:41:12,931 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {520#false} {519#true} #80#return; {520#false} is VALID [2020-07-10 14:41:12,932 INFO L263 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:41:12,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {542#(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; {519#true} is VALID [2020-07-10 14:41:12,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-10 14:41:12,933 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #86#return; {519#true} is VALID [2020-07-10 14:41:12,933 INFO L263 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret10 := main(); {519#true} is VALID [2020-07-10 14:41:12,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#true} ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {519#true} is VALID [2020-07-10 14:41:12,934 INFO L263 TraceCheckUtils]: 6: Hoare triple {519#true} call #t~ret8 := isnan_double(~x~0); {519#true} is VALID [2020-07-10 14:41:12,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {519#true} ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {519#true} is VALID [2020-07-10 14:41:12,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#true} assume true; {519#true} is VALID [2020-07-10 14:41:12,935 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {519#true} {519#true} #78#return; {519#true} is VALID [2020-07-10 14:41:12,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {519#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {519#true} is VALID [2020-07-10 14:41:12,935 INFO L280 TraceCheckUtils]: 11: Hoare triple {519#true} assume 0 == #t~ret8;havoc #t~ret8; {519#true} is VALID [2020-07-10 14:41:12,937 INFO L263 TraceCheckUtils]: 12: Hoare triple {519#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {543#(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,937 INFO L280 TraceCheckUtils]: 13: Hoare triple {543#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {519#true} is VALID [2020-07-10 14:41:12,938 INFO L263 TraceCheckUtils]: 14: Hoare triple {519#true} call #t~ret4 := __fpclassify_double(~x); {543#(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,938 INFO L280 TraceCheckUtils]: 15: Hoare triple {543#(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; {519#true} is VALID [2020-07-10 14:41:12,939 INFO L280 TraceCheckUtils]: 16: Hoare triple {519#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~union1;havoc #t~mem0;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; {519#true} is VALID [2020-07-10 14:41:12,939 INFO L280 TraceCheckUtils]: 17: Hoare triple {519#true} goto; {519#true} is VALID [2020-07-10 14:41:12,939 INFO L280 TraceCheckUtils]: 18: Hoare triple {519#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {519#true} is VALID [2020-07-10 14:41:12,939 INFO L280 TraceCheckUtils]: 19: Hoare triple {519#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {519#true} is VALID [2020-07-10 14:41:12,940 INFO L280 TraceCheckUtils]: 20: Hoare triple {519#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {519#true} is VALID [2020-07-10 14:41:12,941 INFO L280 TraceCheckUtils]: 21: Hoare triple {519#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,941 INFO L280 TraceCheckUtils]: 22: Hoare triple {554#(<= 1 |__fpclassify_double_#res|)} assume true; {554#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:12,943 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {554#(<= 1 |__fpclassify_double_#res|)} {519#true} #82#return; {553#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,943 INFO L280 TraceCheckUtils]: 24: Hoare triple {553#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {553#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-10 14:41:12,944 INFO L280 TraceCheckUtils]: 25: Hoare triple {553#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {520#false} is VALID [2020-07-10 14:41:12,944 INFO L280 TraceCheckUtils]: 26: Hoare triple {520#false} assume true; {520#false} is VALID [2020-07-10 14:41:12,945 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {520#false} {519#true} #80#return; {520#false} is VALID [2020-07-10 14:41:12,945 INFO L280 TraceCheckUtils]: 28: Hoare triple {520#false} ~res~0 := #t~ret9;havoc #t~ret9; {520#false} is VALID [2020-07-10 14:41:12,945 INFO L280 TraceCheckUtils]: 29: Hoare triple {520#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {520#false} is VALID [2020-07-10 14:41:12,945 INFO L280 TraceCheckUtils]: 30: Hoare triple {520#false} assume !false; {520#false} is VALID [2020-07-10 14:41:12,947 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,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395958656] [2020-07-10 14:41:12,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:12,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:12,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557710322] [2020-07-10 14:41:12,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 14:41:12,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:12,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:12,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:12,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:12,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:12,986 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 6 states. [2020-07-10 14:41:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:13,583 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-07-10 14:41:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:13,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 14:41:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 14:41:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 14:41:13,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 14:41:13,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:13,695 INFO L225 Difference]: With dead ends: 51 [2020-07-10 14:41:13,696 INFO L226 Difference]: Without dead ends: 45 [2020-07-10 14:41:13,701 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,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-10 14:41:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-10 14:41:13,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:13,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2020-07-10 14:41:13,743 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2020-07-10 14:41:13,743 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2020-07-10 14:41:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:13,754 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-10 14:41:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-10 14:41:13,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:13,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:13,755 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2020-07-10 14:41:13,756 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2020-07-10 14:41:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:13,759 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-10 14:41:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-10 14:41:13,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:13,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:13,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:13,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 14:41:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-10 14:41:13,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2020-07-10 14:41:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:13,765 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-10 14:41:13,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-10 14:41:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 14:41:13,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:13,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:41:13,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:41:13,767 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 631484603, now seen corresponding path program 1 times [2020-07-10 14:41:13,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:13,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560465539] [2020-07-10 14:41:13,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:13,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:41:13,950 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,962 INFO L168 Benchmark]: Toolchain (without parser) took 4786.28 ms. Allocated memory was 142.1 MB in the beginning and 253.8 MB in the end (delta: 111.7 MB). Free memory was 98.8 MB in the beginning and 128.9 MB in the end (delta: -30.1 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,963 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 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,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.12 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 177.6 MB in the end (delta: -79.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,969 INFO L168 Benchmark]: Boogie Preprocessor took 63.50 ms. Allocated memory is still 199.8 MB. Free memory was 177.6 MB in the beginning and 175.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,969 INFO L168 Benchmark]: RCFGBuilder took 565.24 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 146.6 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,973 INFO L168 Benchmark]: TraceAbstraction took 3756.82 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 145.9 MB in the beginning and 128.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:13,984 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.27 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.12 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 177.6 MB in the end (delta: -79.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.50 ms. Allocated memory is still 199.8 MB. Free memory was 177.6 MB in the beginning and 175.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 565.24 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 146.6 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3756.82 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 145.9 MB in the beginning and 128.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 71.0 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...