/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:53:50,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:53:50,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:53:50,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:53:50,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:53:50,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:53:50,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:53:50,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:53:50,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:53:50,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:53:50,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:53:50,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:53:50,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:53:50,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:53:50,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:53:50,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:53:50,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:53:50,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:53:50,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:53:50,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:53:50,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:53:50,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:53:50,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:53:50,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:53:50,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:53:50,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:53:50,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:53:50,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:53:50,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:53:50,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:53:50,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:53:50,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:53:50,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:53:50,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:53:50,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:53:50,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:53:50,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:53:50,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:53:50,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:53:50,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:53:50,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:53:50,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:53:50,729 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:53:50,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:53:50,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:53:50,731 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:53:50,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:53:50,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:53:50,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:53:50,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:53:50,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:53:50,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:53:50,735 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:53:50,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:53:50,735 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:53:50,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:53:50,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:53:50,736 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:53:50,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:53:50,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:53:50,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:53:50,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:53:50,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:53:50,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:53:50,738 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:53:50,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:53:51,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:53:51,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:53:51,010 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:53:51,011 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:53:51,011 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c [2020-07-08 15:53:51,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832e1cd48/62dc79adce97409ca16990d7f43155c9/FLAG4d0517167 [2020-07-08 15:53:51,518 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:53:51,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c [2020-07-08 15:53:51,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832e1cd48/62dc79adce97409ca16990d7f43155c9/FLAG4d0517167 [2020-07-08 15:53:51,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832e1cd48/62dc79adce97409ca16990d7f43155c9 [2020-07-08 15:53:51,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:53:51,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:53:51,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:51,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:53:51,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:53:51,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:51" (1/1) ... [2020-07-08 15:53:51,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eedc7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:51, skipping insertion in model container [2020-07-08 15:53:51,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:51" (1/1) ... [2020-07-08 15:53:51,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:53:51,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:53:52,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:52,178 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:53:52,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:52,318 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:53:52,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52 WrapperNode [2020-07-08 15:53:52,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:52,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:53:52,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:53:52,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:53:52,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... [2020-07-08 15:53:52,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... [2020-07-08 15:53:52,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... [2020-07-08 15:53:52,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... [2020-07-08 15:53:52,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... [2020-07-08 15:53:52,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... [2020-07-08 15:53:52,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... [2020-07-08 15:53:52,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:53:52,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:53:52,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:53:52,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:53:52,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:53:52,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-08 15:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-08 15:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-08 15:53:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-08 15:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-08 15:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-08 15:53:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 15:53:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 15:53:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 15:53:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 15:53:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-08 15:53:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:53:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:53:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:53:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 15:53:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 15:53:52,920 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:53:52,920 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 15:53:52,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:52 BoogieIcfgContainer [2020-07-08 15:53:52,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:53:52,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:53:52,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:53:52,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:53:52,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:53:51" (1/3) ... [2020-07-08 15:53:52,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2887ae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:52, skipping insertion in model container [2020-07-08 15:53:52,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:52" (2/3) ... [2020-07-08 15:53:52,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2887ae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:52, skipping insertion in model container [2020-07-08 15:53:52,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:52" (3/3) ... [2020-07-08 15:53:52,939 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2020-07-08 15:53:52,950 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:53:52,958 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:53:52,972 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:53:52,994 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:53:52,994 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:53:52,994 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:53:52,994 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:53:52,995 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:53:52,995 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:53:52,995 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:53:52,995 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:53:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2020-07-08 15:53:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 15:53:53,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:53,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:53:53,029 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:53,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1497092675, now seen corresponding path program 1 times [2020-07-08 15:53:53,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:53,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1490190283] [2020-07-08 15:53:53,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:53,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {84#true} is VALID [2020-07-08 15:53:53,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-08 15:53:53,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-08 15:53:53,307 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 15:53:53,308 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {84#true} {84#true} #121#return; {84#true} is VALID [2020-07-08 15:53:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:53,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-08 15:53:53,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-08 15:53:53,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 15:53:53,322 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-08 15:53:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:53,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 15:53:53,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-08 15:53:53,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-08 15:53:53,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-08 15:53:53,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-08 15:53:53,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-08 15:53:53,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 15:53:53,370 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {85#false} {84#true} #125#return; {85#false} is VALID [2020-07-08 15:53:53,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 15:53:53,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-08 15:53:53,373 INFO L263 TraceCheckUtils]: 2: Hoare triple {84#true} call #t~ret4 := __fpclassify_double(~x); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:53,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 15:53:53,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-08 15:53:53,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-08 15:53:53,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-08 15:53:53,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-08 15:53:53,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-08 15:53:53,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 15:53:53,378 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {85#false} {84#true} #125#return; {85#false} is VALID [2020-07-08 15:53:53,378 INFO L280 TraceCheckUtils]: 11: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-08 15:53:53,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-08 15:53:53,378 INFO L280 TraceCheckUtils]: 13: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-08 15:53:53,379 INFO L280 TraceCheckUtils]: 14: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-08 15:53:53,379 INFO L280 TraceCheckUtils]: 15: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 15:53:53,379 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-08 15:53:53,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {84#true} call ULTIMATE.init(); {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 15:53:53,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {112#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {84#true} is VALID [2020-07-08 15:53:53,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} #valid := #valid[0 := 0]; {84#true} is VALID [2020-07-08 15:53:53,388 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#true} assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-08 15:53:53,388 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 15:53:53,389 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {84#true} {84#true} #121#return; {84#true} is VALID [2020-07-08 15:53:53,389 INFO L263 TraceCheckUtils]: 6: Hoare triple {84#true} call #t~ret10 := main(); {84#true} is VALID [2020-07-08 15:53:53,389 INFO L280 TraceCheckUtils]: 7: Hoare triple {84#true} ~x~0 := #t~nondet7; {84#true} is VALID [2020-07-08 15:53:53,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {84#true} havoc #t~nondet7; {84#true} is VALID [2020-07-08 15:53:53,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {84#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {84#true} is VALID [2020-07-08 15:53:53,390 INFO L263 TraceCheckUtils]: 10: Hoare triple {84#true} call #t~ret8 := isnan_double(~x~0); {84#true} is VALID [2020-07-08 15:53:53,391 INFO L280 TraceCheckUtils]: 11: Hoare triple {84#true} ~x := #in~x; {84#true} is VALID [2020-07-08 15:53:53,391 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {84#true} is VALID [2020-07-08 15:53:53,391 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#true} assume true; {84#true} is VALID [2020-07-08 15:53:53,392 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {84#true} {84#true} #117#return; {84#true} is VALID [2020-07-08 15:53:53,392 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {84#true} is VALID [2020-07-08 15:53:53,392 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#true} assume 0 == #t~ret8; {84#true} is VALID [2020-07-08 15:53:53,393 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#true} havoc #t~ret8; {84#true} is VALID [2020-07-08 15:53:53,400 INFO L263 TraceCheckUtils]: 18: Hoare triple {84#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:53,401 INFO L280 TraceCheckUtils]: 19: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 15:53:53,401 INFO L280 TraceCheckUtils]: 20: Hoare triple {84#true} ~y := #in~y; {84#true} is VALID [2020-07-08 15:53:53,403 INFO L263 TraceCheckUtils]: 21: Hoare triple {84#true} call #t~ret4 := __fpclassify_double(~x); {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:53,403 INFO L280 TraceCheckUtils]: 22: Hoare triple {113#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {84#true} is VALID [2020-07-08 15:53:53,403 INFO L280 TraceCheckUtils]: 23: Hoare triple {84#true} havoc ~msw~0; {84#true} is VALID [2020-07-08 15:53:53,404 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#true} havoc ~lsw~0; {84#true} is VALID [2020-07-08 15:53:53,404 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#true} assume !true; {85#false} is VALID [2020-07-08 15:53:53,405 INFO L280 TraceCheckUtils]: 26: Hoare triple {85#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {85#false} is VALID [2020-07-08 15:53:53,405 INFO L280 TraceCheckUtils]: 27: Hoare triple {85#false} #res := 2; {85#false} is VALID [2020-07-08 15:53:53,405 INFO L280 TraceCheckUtils]: 28: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 15:53:53,405 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {85#false} {84#true} #125#return; {85#false} is VALID [2020-07-08 15:53:53,406 INFO L280 TraceCheckUtils]: 30: Hoare triple {85#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {85#false} is VALID [2020-07-08 15:53:53,406 INFO L280 TraceCheckUtils]: 31: Hoare triple {85#false} assume 0 == #t~ret4; {85#false} is VALID [2020-07-08 15:53:53,406 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#false} havoc #t~ret4; {85#false} is VALID [2020-07-08 15:53:53,407 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#false} #res := ~y; {85#false} is VALID [2020-07-08 15:53:53,407 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#false} assume true; {85#false} is VALID [2020-07-08 15:53:53,407 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {85#false} {84#true} #119#return; {85#false} is VALID [2020-07-08 15:53:53,407 INFO L280 TraceCheckUtils]: 36: Hoare triple {85#false} ~res~0 := #t~ret9; {85#false} is VALID [2020-07-08 15:53:53,408 INFO L280 TraceCheckUtils]: 37: Hoare triple {85#false} havoc #t~ret9; {85#false} is VALID [2020-07-08 15:53:53,408 INFO L280 TraceCheckUtils]: 38: Hoare triple {85#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {85#false} is VALID [2020-07-08 15:53:53,409 INFO L280 TraceCheckUtils]: 39: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-08 15:53:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 15:53:53,415 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:53:53,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1490190283] [2020-07-08 15:53:53,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:53:53,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 15:53:53,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193790341] [2020-07-08 15:53:53,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 15:53:53,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:53:53,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 15:53:53,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:53,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 15:53:53,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:53:53,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 15:53:53,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 15:53:53,516 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2020-07-08 15:53:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:54,148 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2020-07-08 15:53:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 15:53:54,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 15:53:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:53:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-08 15:53:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-08 15:53:54,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-08 15:53:54,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:54,446 INFO L225 Difference]: With dead ends: 141 [2020-07-08 15:53:54,447 INFO L226 Difference]: Without dead ends: 74 [2020-07-08 15:53:54,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:53:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-08 15:53:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-08 15:53:54,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:53:54,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-08 15:53:54,612 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-08 15:53:54,613 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-08 15:53:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:54,620 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-08 15:53:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-08 15:53:54,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:54,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:54,622 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-08 15:53:54,622 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-08 15:53:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:54,629 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-08 15:53:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-08 15:53:54,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:54,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:54,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:53:54,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:53:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-08 15:53:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2020-07-08 15:53:54,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 40 [2020-07-08 15:53:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:53:54,638 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2020-07-08 15:53:54,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 15:53:54,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2020-07-08 15:53:54,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2020-07-08 15:53:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 15:53:54,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:54,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:53:54,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:53:54,737 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2105627481, now seen corresponding path program 1 times [2020-07-08 15:53:54,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:54,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454210831] [2020-07-08 15:53:54,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:54,872 INFO L280 TraceCheckUtils]: 0: Hoare triple {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {705#true} is VALID [2020-07-08 15:53:54,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-08 15:53:54,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-08 15:53:54,873 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 15:53:54,873 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {705#true} {705#true} #121#return; {705#true} is VALID [2020-07-08 15:53:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:54,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-08 15:53:54,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-08 15:53:54,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 15:53:54,879 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-08 15:53:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:54,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 15:53:54,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-08 15:53:54,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-08 15:53:54,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {705#true} is VALID [2020-07-08 15:53:54,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {705#true} is VALID [2020-07-08 15:53:54,987 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {705#true} is VALID [2020-07-08 15:53:54,987 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-08 15:53:54,988 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {705#true} is VALID [2020-07-08 15:53:54,988 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-08 15:53:54,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-08 15:53:54,988 INFO L280 TraceCheckUtils]: 10: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {705#true} is VALID [2020-07-08 15:53:54,989 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-08 15:53:54,989 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {705#true} is VALID [2020-07-08 15:53:54,989 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-08 15:53:54,990 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-08 15:53:54,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {705#true} is VALID [2020-07-08 15:53:54,990 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-08 15:53:54,991 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-08 15:53:54,991 INFO L280 TraceCheckUtils]: 18: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-08 15:53:54,992 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:54,993 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:54,994 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #125#return; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:54,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 15:53:54,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-08 15:53:54,996 INFO L263 TraceCheckUtils]: 2: Hoare triple {705#true} call #t~ret4 := __fpclassify_double(~x); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:54,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 15:53:54,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-08 15:53:54,997 INFO L280 TraceCheckUtils]: 5: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-08 15:53:54,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {705#true} is VALID [2020-07-08 15:53:54,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {705#true} is VALID [2020-07-08 15:53:54,998 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {705#true} is VALID [2020-07-08 15:53:54,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-08 15:53:54,999 INFO L280 TraceCheckUtils]: 10: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {705#true} is VALID [2020-07-08 15:53:54,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-08 15:53:54,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-08 15:53:55,000 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {705#true} is VALID [2020-07-08 15:53:55,000 INFO L280 TraceCheckUtils]: 14: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-08 15:53:55,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {705#true} is VALID [2020-07-08 15:53:55,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-08 15:53:55,001 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-08 15:53:55,001 INFO L280 TraceCheckUtils]: 18: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {705#true} is VALID [2020-07-08 15:53:55,001 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-08 15:53:55,002 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-08 15:53:55,002 INFO L280 TraceCheckUtils]: 21: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-08 15:53:55,003 INFO L280 TraceCheckUtils]: 22: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:55,004 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:55,005 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #125#return; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:55,005 INFO L280 TraceCheckUtils]: 25: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:55,006 INFO L280 TraceCheckUtils]: 26: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-08 15:53:55,006 INFO L280 TraceCheckUtils]: 27: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-08 15:53:55,007 INFO L280 TraceCheckUtils]: 28: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-08 15:53:55,007 INFO L280 TraceCheckUtils]: 29: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-08 15:53:55,007 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-08 15:53:55,010 INFO L263 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 15:53:55,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {747#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {705#true} is VALID [2020-07-08 15:53:55,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {705#true} #valid := #valid[0 := 0]; {705#true} is VALID [2020-07-08 15:53:55,011 INFO L280 TraceCheckUtils]: 3: Hoare triple {705#true} assume 0 < #StackHeapBarrier; {705#true} is VALID [2020-07-08 15:53:55,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 15:53:55,011 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {705#true} {705#true} #121#return; {705#true} is VALID [2020-07-08 15:53:55,012 INFO L263 TraceCheckUtils]: 6: Hoare triple {705#true} call #t~ret10 := main(); {705#true} is VALID [2020-07-08 15:53:55,012 INFO L280 TraceCheckUtils]: 7: Hoare triple {705#true} ~x~0 := #t~nondet7; {705#true} is VALID [2020-07-08 15:53:55,012 INFO L280 TraceCheckUtils]: 8: Hoare triple {705#true} havoc #t~nondet7; {705#true} is VALID [2020-07-08 15:53:55,012 INFO L280 TraceCheckUtils]: 9: Hoare triple {705#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {705#true} is VALID [2020-07-08 15:53:55,013 INFO L263 TraceCheckUtils]: 10: Hoare triple {705#true} call #t~ret8 := isnan_double(~x~0); {705#true} is VALID [2020-07-08 15:53:55,013 INFO L280 TraceCheckUtils]: 11: Hoare triple {705#true} ~x := #in~x; {705#true} is VALID [2020-07-08 15:53:55,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {705#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {705#true} is VALID [2020-07-08 15:53:55,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2020-07-08 15:53:55,014 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {705#true} {705#true} #117#return; {705#true} is VALID [2020-07-08 15:53:55,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {705#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {705#true} is VALID [2020-07-08 15:53:55,014 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#true} assume 0 == #t~ret8; {705#true} is VALID [2020-07-08 15:53:55,015 INFO L280 TraceCheckUtils]: 17: Hoare triple {705#true} havoc #t~ret8; {705#true} is VALID [2020-07-08 15:53:55,016 INFO L263 TraceCheckUtils]: 18: Hoare triple {705#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:55,017 INFO L280 TraceCheckUtils]: 19: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 15:53:55,017 INFO L280 TraceCheckUtils]: 20: Hoare triple {705#true} ~y := #in~y; {705#true} is VALID [2020-07-08 15:53:55,018 INFO L263 TraceCheckUtils]: 21: Hoare triple {705#true} call #t~ret4 := __fpclassify_double(~x); {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:55,018 INFO L280 TraceCheckUtils]: 22: Hoare triple {748#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {705#true} is VALID [2020-07-08 15:53:55,019 INFO L280 TraceCheckUtils]: 23: Hoare triple {705#true} havoc ~msw~0; {705#true} is VALID [2020-07-08 15:53:55,019 INFO L280 TraceCheckUtils]: 24: Hoare triple {705#true} havoc ~lsw~0; {705#true} is VALID [2020-07-08 15:53:55,019 INFO L280 TraceCheckUtils]: 25: Hoare triple {705#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {705#true} is VALID [2020-07-08 15:53:55,019 INFO L280 TraceCheckUtils]: 26: Hoare triple {705#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {705#true} is VALID [2020-07-08 15:53:55,020 INFO L280 TraceCheckUtils]: 27: Hoare triple {705#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {705#true} is VALID [2020-07-08 15:53:55,020 INFO L280 TraceCheckUtils]: 28: Hoare triple {705#true} ~msw~0 := #t~mem0; {705#true} is VALID [2020-07-08 15:53:55,020 INFO L280 TraceCheckUtils]: 29: Hoare triple {705#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {705#true} is VALID [2020-07-08 15:53:55,021 INFO L280 TraceCheckUtils]: 30: Hoare triple {705#true} havoc #t~union1; {705#true} is VALID [2020-07-08 15:53:55,021 INFO L280 TraceCheckUtils]: 31: Hoare triple {705#true} havoc #t~mem0; {705#true} is VALID [2020-07-08 15:53:55,021 INFO L280 TraceCheckUtils]: 32: Hoare triple {705#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {705#true} is VALID [2020-07-08 15:53:55,022 INFO L280 TraceCheckUtils]: 33: Hoare triple {705#true} ~lsw~0 := #t~mem2; {705#true} is VALID [2020-07-08 15:53:55,022 INFO L280 TraceCheckUtils]: 34: Hoare triple {705#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {705#true} is VALID [2020-07-08 15:53:55,022 INFO L280 TraceCheckUtils]: 35: Hoare triple {705#true} havoc #t~mem2; {705#true} is VALID [2020-07-08 15:53:55,022 INFO L280 TraceCheckUtils]: 36: Hoare triple {705#true} havoc #t~union3; {705#true} is VALID [2020-07-08 15:53:55,023 INFO L280 TraceCheckUtils]: 37: Hoare triple {705#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {705#true} is VALID [2020-07-08 15:53:55,023 INFO L280 TraceCheckUtils]: 38: Hoare triple {705#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {705#true} is VALID [2020-07-08 15:53:55,023 INFO L280 TraceCheckUtils]: 39: Hoare triple {705#true} goto; {705#true} is VALID [2020-07-08 15:53:55,023 INFO L280 TraceCheckUtils]: 40: Hoare triple {705#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {705#true} is VALID [2020-07-08 15:53:55,024 INFO L280 TraceCheckUtils]: 41: Hoare triple {705#true} #res := 2; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:55,025 INFO L280 TraceCheckUtils]: 42: Hoare triple {772#(<= 2 |__fpclassify_double_#res|)} assume true; {772#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:55,026 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {772#(<= 2 |__fpclassify_double_#res|)} {705#true} #125#return; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:55,027 INFO L280 TraceCheckUtils]: 44: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {771#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:55,028 INFO L280 TraceCheckUtils]: 45: Hoare triple {771#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {706#false} is VALID [2020-07-08 15:53:55,028 INFO L280 TraceCheckUtils]: 46: Hoare triple {706#false} havoc #t~ret4; {706#false} is VALID [2020-07-08 15:53:55,028 INFO L280 TraceCheckUtils]: 47: Hoare triple {706#false} #res := ~y; {706#false} is VALID [2020-07-08 15:53:55,029 INFO L280 TraceCheckUtils]: 48: Hoare triple {706#false} assume true; {706#false} is VALID [2020-07-08 15:53:55,029 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {706#false} {705#true} #119#return; {706#false} is VALID [2020-07-08 15:53:55,029 INFO L280 TraceCheckUtils]: 50: Hoare triple {706#false} ~res~0 := #t~ret9; {706#false} is VALID [2020-07-08 15:53:55,029 INFO L280 TraceCheckUtils]: 51: Hoare triple {706#false} havoc #t~ret9; {706#false} is VALID [2020-07-08 15:53:55,030 INFO L280 TraceCheckUtils]: 52: Hoare triple {706#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {706#false} is VALID [2020-07-08 15:53:55,030 INFO L280 TraceCheckUtils]: 53: Hoare triple {706#false} assume !false; {706#false} is VALID [2020-07-08 15:53:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 15:53:55,034 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:53:55,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454210831] [2020-07-08 15:53:55,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:53:55,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 15:53:55,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600416776] [2020-07-08 15:53:55,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-08 15:53:55,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:53:55,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 15:53:55,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:55,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 15:53:55,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:53:55,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 15:53:55,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:53:55,093 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2020-07-08 15:53:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:55,709 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2020-07-08 15:53:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:53:55,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-07-08 15:53:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:53:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:53:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 15:53:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:53:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 15:53:55,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-08 15:53:55,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:55,818 INFO L225 Difference]: With dead ends: 88 [2020-07-08 15:53:55,818 INFO L226 Difference]: Without dead ends: 79 [2020-07-08 15:53:55,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:53:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-08 15:53:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2020-07-08 15:53:55,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:53:55,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 78 states. [2020-07-08 15:53:55,886 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 78 states. [2020-07-08 15:53:55,887 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 78 states. [2020-07-08 15:53:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:55,896 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-08 15:53:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-08 15:53:55,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:55,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:55,898 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 79 states. [2020-07-08 15:53:55,899 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 79 states. [2020-07-08 15:53:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:55,913 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-07-08 15:53:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2020-07-08 15:53:55,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:55,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:55,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:53:55,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:53:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-08 15:53:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-08 15:53:55,928 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 54 [2020-07-08 15:53:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:53:55,929 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-08 15:53:55,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 15:53:55,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-08 15:53:56,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-08 15:53:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 15:53:56,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:56,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:53:56,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:53:56,036 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash 358345182, now seen corresponding path program 1 times [2020-07-08 15:53:56,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:56,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596652907] [2020-07-08 15:53:56,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:56,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1268#true} is VALID [2020-07-08 15:53:56,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-08 15:53:56,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-08 15:53:56,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 15:53:56,130 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1268#true} {1268#true} #121#return; {1268#true} is VALID [2020-07-08 15:53:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:56,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-08 15:53:56,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-08 15:53:56,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 15:53:56,134 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-08 15:53:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:56,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 15:53:56,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-08 15:53:56,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-08 15:53:56,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1268#true} is VALID [2020-07-08 15:53:56,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1268#true} is VALID [2020-07-08 15:53:56,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1268#true} is VALID [2020-07-08 15:53:56,260 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-08 15:53:56,261 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1268#true} is VALID [2020-07-08 15:53:56,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-08 15:53:56,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-08 15:53:56,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1268#true} is VALID [2020-07-08 15:53:56,262 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-08 15:53:56,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1268#true} is VALID [2020-07-08 15:53:56,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-08 15:53:56,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-08 15:53:56,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1268#true} is VALID [2020-07-08 15:53:56,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-08 15:53:56,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-08 15:53:56,264 INFO L280 TraceCheckUtils]: 18: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-08 15:53:56,264 INFO L280 TraceCheckUtils]: 19: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-08 15:53:56,264 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-08 15:53:56,264 INFO L280 TraceCheckUtils]: 21: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-08 15:53:56,265 INFO L280 TraceCheckUtils]: 22: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:56,266 INFO L280 TraceCheckUtils]: 23: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:56,267 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #125#return; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:56,268 INFO L280 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 15:53:56,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-08 15:53:56,270 INFO L263 TraceCheckUtils]: 2: Hoare triple {1268#true} call #t~ret4 := __fpclassify_double(~x); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:56,270 INFO L280 TraceCheckUtils]: 3: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 15:53:56,270 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-08 15:53:56,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-08 15:53:56,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1268#true} is VALID [2020-07-08 15:53:56,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1268#true} is VALID [2020-07-08 15:53:56,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1268#true} is VALID [2020-07-08 15:53:56,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-08 15:53:56,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1268#true} is VALID [2020-07-08 15:53:56,272 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-08 15:53:56,272 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-08 15:53:56,273 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1268#true} is VALID [2020-07-08 15:53:56,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-08 15:53:56,273 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1268#true} is VALID [2020-07-08 15:53:56,273 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-08 15:53:56,274 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-08 15:53:56,274 INFO L280 TraceCheckUtils]: 18: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1268#true} is VALID [2020-07-08 15:53:56,274 INFO L280 TraceCheckUtils]: 19: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-08 15:53:56,274 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-08 15:53:56,275 INFO L280 TraceCheckUtils]: 21: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-08 15:53:56,275 INFO L280 TraceCheckUtils]: 22: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-08 15:53:56,275 INFO L280 TraceCheckUtils]: 23: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-08 15:53:56,276 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-08 15:53:56,276 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:56,277 INFO L280 TraceCheckUtils]: 26: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:56,278 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #125#return; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:56,279 INFO L280 TraceCheckUtils]: 28: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:56,279 INFO L280 TraceCheckUtils]: 29: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-08 15:53:56,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-08 15:53:56,280 INFO L280 TraceCheckUtils]: 31: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-08 15:53:56,280 INFO L280 TraceCheckUtils]: 32: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-08 15:53:56,281 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-08 15:53:56,283 INFO L263 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 15:53:56,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {1313#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1268#true} is VALID [2020-07-08 15:53:56,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {1268#true} #valid := #valid[0 := 0]; {1268#true} is VALID [2020-07-08 15:53:56,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {1268#true} assume 0 < #StackHeapBarrier; {1268#true} is VALID [2020-07-08 15:53:56,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 15:53:56,284 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1268#true} {1268#true} #121#return; {1268#true} is VALID [2020-07-08 15:53:56,285 INFO L263 TraceCheckUtils]: 6: Hoare triple {1268#true} call #t~ret10 := main(); {1268#true} is VALID [2020-07-08 15:53:56,285 INFO L280 TraceCheckUtils]: 7: Hoare triple {1268#true} ~x~0 := #t~nondet7; {1268#true} is VALID [2020-07-08 15:53:56,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {1268#true} havoc #t~nondet7; {1268#true} is VALID [2020-07-08 15:53:56,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {1268#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1268#true} is VALID [2020-07-08 15:53:56,286 INFO L263 TraceCheckUtils]: 10: Hoare triple {1268#true} call #t~ret8 := isnan_double(~x~0); {1268#true} is VALID [2020-07-08 15:53:56,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {1268#true} ~x := #in~x; {1268#true} is VALID [2020-07-08 15:53:56,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1268#true} is VALID [2020-07-08 15:53:56,286 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 15:53:56,287 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1268#true} {1268#true} #117#return; {1268#true} is VALID [2020-07-08 15:53:56,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {1268#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1268#true} is VALID [2020-07-08 15:53:56,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {1268#true} assume 0 == #t~ret8; {1268#true} is VALID [2020-07-08 15:53:56,287 INFO L280 TraceCheckUtils]: 17: Hoare triple {1268#true} havoc #t~ret8; {1268#true} is VALID [2020-07-08 15:53:56,288 INFO L263 TraceCheckUtils]: 18: Hoare triple {1268#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:56,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 15:53:56,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {1268#true} ~y := #in~y; {1268#true} is VALID [2020-07-08 15:53:56,290 INFO L263 TraceCheckUtils]: 21: Hoare triple {1268#true} call #t~ret4 := __fpclassify_double(~x); {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:56,290 INFO L280 TraceCheckUtils]: 22: Hoare triple {1314#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1268#true} is VALID [2020-07-08 15:53:56,291 INFO L280 TraceCheckUtils]: 23: Hoare triple {1268#true} havoc ~msw~0; {1268#true} is VALID [2020-07-08 15:53:56,291 INFO L280 TraceCheckUtils]: 24: Hoare triple {1268#true} havoc ~lsw~0; {1268#true} is VALID [2020-07-08 15:53:56,291 INFO L280 TraceCheckUtils]: 25: Hoare triple {1268#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L20-2 {1268#true} is VALID [2020-07-08 15:53:56,291 INFO L280 TraceCheckUtils]: 26: Hoare triple {1268#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21 {1268#true} is VALID [2020-07-08 15:53:56,292 INFO L280 TraceCheckUtils]: 27: Hoare triple {1268#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L22 {1268#true} is VALID [2020-07-08 15:53:56,292 INFO L280 TraceCheckUtils]: 28: Hoare triple {1268#true} ~msw~0 := #t~mem0; {1268#true} is VALID [2020-07-08 15:53:56,292 INFO L280 TraceCheckUtils]: 29: Hoare triple {1268#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23-1 {1268#true} is VALID [2020-07-08 15:53:56,292 INFO L280 TraceCheckUtils]: 30: Hoare triple {1268#true} havoc #t~union1; {1268#true} is VALID [2020-07-08 15:53:56,293 INFO L280 TraceCheckUtils]: 31: Hoare triple {1268#true} havoc #t~mem0; {1268#true} is VALID [2020-07-08 15:53:56,293 INFO L280 TraceCheckUtils]: 32: Hoare triple {1268#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L24 {1268#true} is VALID [2020-07-08 15:53:56,293 INFO L280 TraceCheckUtils]: 33: Hoare triple {1268#true} ~lsw~0 := #t~mem2; {1268#true} is VALID [2020-07-08 15:53:56,293 INFO L280 TraceCheckUtils]: 34: Hoare triple {1268#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L24-2 {1268#true} is VALID [2020-07-08 15:53:56,294 INFO L280 TraceCheckUtils]: 35: Hoare triple {1268#true} havoc #t~mem2; {1268#true} is VALID [2020-07-08 15:53:56,294 INFO L280 TraceCheckUtils]: 36: Hoare triple {1268#true} havoc #t~union3; {1268#true} is VALID [2020-07-08 15:53:56,294 INFO L280 TraceCheckUtils]: 37: Hoare triple {1268#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L21-1 {1268#true} is VALID [2020-07-08 15:53:56,294 INFO L280 TraceCheckUtils]: 38: Hoare triple {1268#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1268#true} is VALID [2020-07-08 15:53:56,294 INFO L280 TraceCheckUtils]: 39: Hoare triple {1268#true} goto; {1268#true} is VALID [2020-07-08 15:53:56,295 INFO L280 TraceCheckUtils]: 40: Hoare triple {1268#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1268#true} is VALID [2020-07-08 15:53:56,295 INFO L280 TraceCheckUtils]: 41: Hoare triple {1268#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1268#true} is VALID [2020-07-08 15:53:56,295 INFO L280 TraceCheckUtils]: 42: Hoare triple {1268#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1268#true} is VALID [2020-07-08 15:53:56,295 INFO L280 TraceCheckUtils]: 43: Hoare triple {1268#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1268#true} is VALID [2020-07-08 15:53:56,296 INFO L280 TraceCheckUtils]: 44: Hoare triple {1268#true} #res := 1; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:56,297 INFO L280 TraceCheckUtils]: 45: Hoare triple {1341#(= 1 |__fpclassify_double_#res|)} assume true; {1341#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-08 15:53:56,298 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1341#(= 1 |__fpclassify_double_#res|)} {1268#true} #125#return; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:56,298 INFO L280 TraceCheckUtils]: 47: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1340#(= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-08 15:53:56,299 INFO L280 TraceCheckUtils]: 48: Hoare triple {1340#(= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4; {1269#false} is VALID [2020-07-08 15:53:56,299 INFO L280 TraceCheckUtils]: 49: Hoare triple {1269#false} havoc #t~ret4; {1269#false} is VALID [2020-07-08 15:53:56,300 INFO L280 TraceCheckUtils]: 50: Hoare triple {1269#false} #res := ~y; {1269#false} is VALID [2020-07-08 15:53:56,300 INFO L280 TraceCheckUtils]: 51: Hoare triple {1269#false} assume true; {1269#false} is VALID [2020-07-08 15:53:56,300 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1269#false} {1268#true} #119#return; {1269#false} is VALID [2020-07-08 15:53:56,300 INFO L280 TraceCheckUtils]: 53: Hoare triple {1269#false} ~res~0 := #t~ret9; {1269#false} is VALID [2020-07-08 15:53:56,301 INFO L280 TraceCheckUtils]: 54: Hoare triple {1269#false} havoc #t~ret9; {1269#false} is VALID [2020-07-08 15:53:56,301 INFO L280 TraceCheckUtils]: 55: Hoare triple {1269#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {1269#false} is VALID [2020-07-08 15:53:56,301 INFO L280 TraceCheckUtils]: 56: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-08 15:53:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 15:53:56,306 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:53:56,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596652907] [2020-07-08 15:53:56,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:53:56,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 15:53:56,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12442915] [2020-07-08 15:53:56,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-08 15:53:56,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:53:56,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 15:53:56,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:56,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 15:53:56,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:53:56,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 15:53:56,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:53:56,370 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2020-07-08 15:53:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:56,981 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-08 15:53:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:53:56,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2020-07-08 15:53:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:53:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:53:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 15:53:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:53:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2020-07-08 15:53:56,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2020-07-08 15:53:57,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:57,122 INFO L225 Difference]: With dead ends: 92 [2020-07-08 15:53:57,122 INFO L226 Difference]: Without dead ends: 83 [2020-07-08 15:53:57,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:53:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-08 15:53:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-07-08 15:53:57,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:53:57,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 78 states. [2020-07-08 15:53:57,195 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 78 states. [2020-07-08 15:53:57,195 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 78 states. [2020-07-08 15:53:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:57,200 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-08 15:53:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-08 15:53:57,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:57,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:57,201 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 83 states. [2020-07-08 15:53:57,202 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 83 states. [2020-07-08 15:53:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:57,206 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2020-07-08 15:53:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2020-07-08 15:53:57,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:57,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:57,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:53:57,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:53:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-08 15:53:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-07-08 15:53:57,212 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 57 [2020-07-08 15:53:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:53:57,212 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-07-08 15:53:57,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 15:53:57,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 86 transitions. [2020-07-08 15:53:57,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-07-08 15:53:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 15:53:57,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:57,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:53:57,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:53:57,322 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:57,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1239578082, now seen corresponding path program 1 times [2020-07-08 15:53:57,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:57,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1343500700] [2020-07-08 15:53:57,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 15:53:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 15:53:57,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 15:53:57,532 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1145) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1014) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 15:53:57,538 INFO L168 Benchmark]: Toolchain (without parser) took 5603.02 ms. Allocated memory was 141.0 MB in the beginning and 279.4 MB in the end (delta: 138.4 MB). Free memory was 102.2 MB in the beginning and 182.2 MB in the end (delta: -80.0 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:57,539 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 15:53:57,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.11 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 102.0 MB in the beginning and 183.0 MB in the end (delta: -81.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:57,541 INFO L168 Benchmark]: Boogie Preprocessor took 53.50 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 180.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:57,542 INFO L168 Benchmark]: RCFGBuilder took 558.08 ms. Allocated memory is still 203.9 MB. Free memory was 180.6 MB in the beginning and 145.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:57,543 INFO L168 Benchmark]: TraceAbstraction took 4602.70 ms. Allocated memory was 203.9 MB in the beginning and 279.4 MB in the end (delta: 75.5 MB). Free memory was 145.1 MB in the beginning and 182.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:57,546 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.24 ms. Allocated memory is still 141.0 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 382.11 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 102.0 MB in the beginning and 183.0 MB in the end (delta: -81.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.50 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 180.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 558.08 ms. Allocated memory is still 203.9 MB. Free memory was 180.6 MB in the beginning and 145.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4602.70 ms. Allocated memory was 203.9 MB in the beginning and 279.4 MB in the end (delta: 75.5 MB). Free memory was 145.1 MB in the beginning and 182.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 38.4 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...